Добірка наукової літератури з теми "Constrained exploration"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Constrained exploration".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Constrained exploration"
Pankayaraj, Pathmanathan, and Pradeep Varakantham. "Constrained Reinforcement Learning in Hard Exploration Problems." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 12 (June 26, 2023): 15055–63. http://dx.doi.org/10.1609/aaai.v37i12.26757.
Повний текст джерелаMellado, Nicolas, David Vanderhaeghe, Charlotte Hoarau, Sidonie Christophe, Mathieu Brédif, and Loic Barthe. "Constrained palette-space exploration." ACM Transactions on Graphics 36, no. 4 (July 20, 2017): 1–14. http://dx.doi.org/10.1145/3072959.3073650.
Повний текст джерелаDuncan, Christian A., Stephen G. Kobourov, and V. S. Anil Kumar. "Optimal constrained graph exploration." ACM Transactions on Algorithms 2, no. 3 (July 2006): 380–402. http://dx.doi.org/10.1145/1159892.1159897.
Повний текст джерелаYang, Qisong, and Matthijs T. J. Spaan. "CEM: Constrained Entropy Maximization for Task-Agnostic Safe Exploration." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 9 (June 26, 2023): 10798–806. http://dx.doi.org/10.1609/aaai.v37i9.26281.
Повний текст джерелаIvanov, Alexander, and Mark Campbell. "Uncertainty Constrained Robotic Exploration: An Integrated Exploration Planner." IEEE Transactions on Control Systems Technology 27, no. 1 (January 2019): 146–60. http://dx.doi.org/10.1109/tcst.2017.2759729.
Повний текст джерелаAhuir, J., A. S. Brun, and A. Strugarek. "From stellar coronae to gyrochronology: A theoretical and observational exploration." Astronomy & Astrophysics 635 (March 2020): A170. http://dx.doi.org/10.1051/0004-6361/201936974.
Повний текст джерелаDeng, Bailin, Sofien Bouaziz, Mario Deuss, Alexandre Kaspar, Yuliy Schwartzburg, and Mark Pauly. "Interactive design exploration for constrained meshes." Computer-Aided Design 61 (April 2015): 13–23. http://dx.doi.org/10.1016/j.cad.2014.01.004.
Повний текст джерелаYang, Yong-Liang, Yi-Jun Yang, Helmut Pottmann, and Niloy J. Mitra. "Shape space exploration of constrained meshes." ACM Transactions on Graphics 30, no. 6 (December 2011): 1–12. http://dx.doi.org/10.1145/2070781.2024158.
Повний текст джерелаAngmalisang, Helen Yuliana, Syaiful Anam, and Sobri Abusini. "Leaders and followers algorithm for constrained non-linear optimization." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (January 1, 2019): 162. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp162-169.
Повний текст джерелаFrancis, Gilad, Lionel Ott, Roman Marchant, and Fabio Ramos. "Occupancy map building through Bayesian exploration." International Journal of Robotics Research 38, no. 7 (May 6, 2019): 769–92. http://dx.doi.org/10.1177/0278364919846549.
Повний текст джерелаДисертації з теми "Constrained exploration"
Garcelon, Evrard. "Constrained Exploration in Reinforcement Learning." Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAG007.
Повний текст джерелаA major application of machine learning is to provide personnalized content to different users. In general, the algorithms powering those recommandation are supervised learning algorithm. That is to say the data used to train those algorithms are assumed to be sampled from the same distribution. However, the data are generated through interactions between the users and the recommendation algorithms. Thus, recommendations for a user a time t can have an impact on the set of pertinent recommandation at a later time. Therefore, it is necessary to take those interactions into account. This setting is reminiscent of the online learning setting. Among online learning algorithms, Reinforcement Learning algorithms (RL) looks the most promising to replace supervised learning algorithms for applications requiring a certain degree of personnalization. The deployement in production of RL algorithms presents some challenges such as being able to guarantee a certain level of performance during exploration phases or how to guarantee privacy of the data collected by RL algorithms. In this thesis, we consider different constraints limiting the use of RL algorithms and provides both empirical and theoretical results on the impact of those constraints on the learning process
Carvalho, Filho José Gilmar Nunes de. "Multi-robot exploration with constrained communication." reponame:Repositório Institucional da UFSC, 2016. https://repositorio.ufsc.br/xmlui/handle/123456789/171998.
Повний текст джерелаMade available in DSpace on 2016-12-27T03:11:05Z (GMT). No. of bitstreams: 1 342277.pdf: 5444057 bytes, checksum: 36965f3be2f7f870b8ed9ef5eee8e702 (MD5) Previous issue date: 2016
Abstract : Over the last two decades, several methods for exploration with Multi-Robot Systems (MRS) have been proposed, most of them based on the allocation of frontiers (exploration targets) and typically applying local optimization policies. However, communication issues have usually been neglected. This thesis investigates multi-robot exploration by considering that robots have limited communication radius. Two methods, one based on a flat network architecture (DSM) and another based on a hierarchical architecture (HSM), were proposed to share map information. While DSM considers a propagation scheme to share information and synchronize the map of robots, HSM organizes robots in a hierarchical architecture where some robots act as leaders (clusterheads) and are responsible for synchronizing the maps of the robots in the network. Formal proof that both methods guarantee the synchronization of the map of all robots in a network is presented. In addition, experiments were conducted by considering systems with different number of robots, network topologies and different map's sizes. The results show that both methods are able to synchronize the map of the robots when they can lose communication links, but HKM usually presents smaller convergence time, number of exchanged messages and amount of transmitted data. We also propose Hierarchical K-Means (HKME), a method for multi-robot coordination in exploration tasks that handles communication problems, such as link losses. To handle communication among robots, HKME arranges them into clusters and elects leaders for each. Clusters evolve dynamically as robots lose or establish communication with their peers. HKME uses HSM to guarantee that the map of the robots are synchronized and also uses the hierarchical organization of the robots to coordinate them in order to minimize the variance of the time at which they reach all regions of the workspace, while balancing their workload and decreasing the exploration time. Experiments were conducted by considering different types of workspace and communication radius. The results show that HKME behaves like a centralized algorithm when communication is granted, while being able to withstand severe degradation in communication radius.
Ao longo das últimas décadas, vários métodos de exploração com os Sistemas Multi-robôs (SMR) têm sido propostos, a maioria deles com base na alocação de fronteiras (alvos de exploração) e normalmente aplicando políticas de otimização locais. No entanto, os problemas de comunicação têm geralmente sido negligenciados. Esta tese investiga a exploração multi-robô, considerando que os robôs têm raio de comunicação limitado. Dois métodos, um baseado em uma arquitetura de rede plana (DSM) e outro baseado em uma arquitetura hierárquica (HSM), foram propostos para compartilhar informações de mapa. Enquanto o DSM considera um esquema de propagação para compartilhar informações e sincronizar o mapa dos robôs, o HSM organiza robôs em uma arquitetura hierárquica, onde alguns robôs atuam como líderes (clusterheads) e são responsáveis por sincronizar os mapas dos robôs na rede. A prova formal de que ambos os métodos garantem a sincronização do mapa de todos os robôs na rede é apresentada. Além disso, experimentos foram conduzidos considerando sistemas com diferentes números de robôs, topologias de rede e tamanhos de mapa. Os resultados mostram que ambos os métodos são capazes de sincronizar o mapa dos robôs quando eles podem perder links de comunicação, mas o HKM geralmente apresenta menor tempo de convergência, o número de mensagens trocadas e a quantidade de dados transmitidos. Propomos também Hierarchical K-Means (HKME), um método de coordenação multi-robô em tarefas de exploração que lida com problemas de comunicação, tais como perdas de links. Para lidar com a comunicação entre robôs, o HKME os organiza em clusters e elege os líderes de cada um. Clusters evoluem dinamicamente a medida que os robôs perdem ou estabelecem links de comunicação. O HKME usa o HSM para garantir que o mapa dos robôs se mantenham sincronizados e também usa a organização hierárquica dos robôs para coordená-los, a fim de minimizar a variância do momento em que eles atinjem todas as regiões do espaço de trabalho, ao mesmo tempo que equilibra a carga de trabalho e diminui o tempo de exploração. Experimentos foram realizadas considerando diferentes tipos de espaço de trabalho e raios de comunicação. Os resultados mostram que o HKME comporta-se como um algoritmo centralizada quando a comunicação é garantida, sendo capaz de lidar com uma degradação severa no raio de comunicação.
Duong, Khanh-Chuong. "Constrained clustering by constraint programming." Thesis, Orléans, 2014. http://www.theses.fr/2014ORLE2049/document.
Повний текст джерелаCluster analysis is an important task in Data Mining with hundreds of different approaches in the literature. Since the last decade, the cluster analysis has been extended to constrained clustering, also called semi-supervised clustering, so as to integrate previous knowledge on data to clustering algorithms. In this dissertation, we explore Constraint Programming (CP) for solving the task of constrained clustering. The main principles in CP are: (1) users specify declaratively the problem in a Constraint Satisfaction Problem; (2) solvers search for solutions by constraint propagation and search. Relying on CP has two main advantages: the declarativity, which enables to easily add new constraints and the ability to find an optimal solution satisfying all the constraints (when there exists one). We propose two models based on CP to address constrained clustering tasks. The models are flexible and general and supports instance-level constraints and different cluster-level constraints. It also allows the users to choose among different optimization criteria. In order to improve the efficiency, different aspects have been studied in the dissertation. Experiments on various classical datasets show that our models are competitive with other exact approaches. We show that our models can easily be embedded in a more general process and we illustrate this on the problem of finding the Pareto front of a bi-criterion optimization process
Kettler, Daniel Terrance. "Mechanical design for the tactile exploration of constrained internal geometries." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50272.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
MIT Institute Archives copy: with CD-ROM; divisional library copy with no CD-ROM.
Includes bibliographical references (p. 93-98).
Rising world oil prices and advanced oil recovery techniques have made it economically attractive to rehabilitate abandoned oil wells. This requires guiding tools through well junctions where divergent branches leave the main wellbore. The unknown locations and shapes of these junctions must be determined. Harsh down-well conditions prevent the use of ranged sensors. However, robotic tactile exploration using a manipulator is well suited to this problem. This tactile characterization must be done quickly because of the high costs of working on oil wells. Consequently, intelligent tactile exploration algorithms that can characterize a shape using sparse data sets must be developed. This thesis explores the design and system architecture of robotic manipulators for down-well tactile exploration. A design approach minimizing sensing is adopted to produce a system that is mechanically robust and suited to the harsh down-well environment. A feasibility study on down-well tactile exploration manipulators is conducted. This study focuses on the mature robotic technology of link and joint manipulators with zero or low kinematic redundancy. This study produces a field system architecture that specifies a unified combination of control, sensing, kinematic solutions for down-well applications. An experimental system is built to demonstrate the proposed field system architecture and test control and intelligent tactile exploration algorithms. Experimental results to date have indicated acceptability of the proposed field system architecture and have demonstrated the ability to characterize geometry with sparse tactile data.
(cont.) Serpentine manipulators implemented using digital mechatronic actuation are also considered. Digital mechatronic devices use actuators with discrete output states and the potential to be mechanically robust and inexpensive. The design of digital mechatronic devices is challenging. Design parameter optimization methods are developed and applied to a design case study of a manipulator in a constrained workspace. This research demonstrates that down-well tactile exploration with a manipulator is feasible. Experimental results show that the proposed field system architecture, a 4 degree-of-freedom anthropomorphic manipulator, can obtain accurate tactile data without using any sensor feedback besides manipulator joint angles.
by Daniel Terrance Kettler.
S.M.
Chung, Jen Jen. "Learning to soar: exploration strategies in reinforcement learning for resource-constrained missions." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/11733.
Повний текст джерелаSun, Hua. "Throughput constrained and area optimized dataflow synthesis for FPGAS." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2276.pdf.
Повний текст джерелаBhattacharjee, Protim [Verfasser], Veniamin [Akademischer Betreuer] Morgenshtern, and Martin [Gutachter] Burger. "Compressed Sensing based Image Acquisition Methodologies for Constrained Autonomous Exploration Systems with Single Pixel Cameras / Protim Bhattacharjee ; Gutachter: Martin Burger ; Betreuer: Veniamin Morgenshtern." Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2021. http://d-nb.info/123348429X/34.
Повний текст джерелаWilliams, Nicholas Cory. "Geologically-constrained UBC–GIF gravity and magnetic inversions with examples from the Agnew-Wiluna greenstone belt, Western Australia." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2744.
Повний текст джерелаClifford, Gayle. ""Am iz kwiin" (I'm his queen) : an exploration of mothers' disclosure of maternal HIV to their children in Kingston, Jamaica : using feminist Interpretative Phenomenological Analysis (IPA) in a resource-constrained context." Thesis, City, University of London, 2018. http://openaccess.city.ac.uk/21213/.
Повний текст джерелаCraparo, Emily M. (Emily Marie) 1980. "Cooperative exploration under communication constraints." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46558.
Повний текст джерелаIncludes bibliographical references (leaves 131-137).
The cooperative exploration problem necessarily involves communication among agents, while the spatial separation inherent in this task places fundamental limits on the amount of data that can be transmitted. However, the impact of limited communication on the exploration process has not been fully characterized. Existing exploration algorithms do not realistically model the tradeoff between expansion, which allows more rapid exploration of the area of interest, and maintenance of close relative proximity among agents, which facilitates communication. This thesis develops new algorithms applicable to the problem of cooperative exploration under communication constraints. The exploration problem is decomposed into two parts. In the first part, cooperative exploration is considered in the context of a hierarchical communication framework known as a mobile backbone network. In such a network, mobile backbone nodes, which have good mobility and communication capabilities, provide communication support for regular nodes, which are constrained in movement and communication capabilities but which can sense the environment. New exact and approximation algorithms are developed for throughput optimization in networks composed of stationary regular nodes, and new extensions are formulated to take advantage of regular node mobility. These algorithms are then applied to a cooperative coverage problem. In the second part of this work, techniques are developed for utilizing a given level of throughput in the context of cooperative estimation. The mathematical properties of the information form of the Kalman filter are leveraged in the development of two algorithms for selecting highly informative portions of the information matrix for transmission. One algorithm, a fully polynomial time approximation scheme, provides provably good results in computationally tractable time for problem instances of a particular structure. The other, a heuristic method applicable to instances of arbitrary matrix structure, performs very well in simulation for randomly-generated problems of realistic dimension.
by Emily M. Craparo.
Ph.D.
Книги з теми "Constrained exploration"
National Research Council (U.S.). Committee to Review NASA's Exploration Technology Development Program. A constrained space exploration technology program: A review of NASA's exploration technology development program. Washington, D.C: National Academies Press, 2008.
Знайти повний текст джерелаNational Research Council (U.S.). Committee to Review NASA's Exploration Technology Development Program. A constrained space exploration technology program: A review of NASA's exploration technology development program. Washington, D.C: National Academies Press, 2008.
Знайти повний текст джерелаA constrained space exploration technology program: A review of NASA's exploration technology development program. Washington, D.C: National Academies Press, 2008.
Знайти повний текст джерелаMeh, Césaire Assah. Entrepreneurial risk, credit constraints, and the corporate income tax: A quantitative exploration. Ottawa: Bank of Canada, 2002.
Знайти повний текст джерелаOffice, World Bank Indonesia, ed. Opportunities and constraints for civil service reform in Indonesia: Exploration of a new approach and methodology. Jakarta: World Bank Office Jakarta, 2006.
Знайти повний текст джерелаTimmer, Adwin H. From design space exploration to code generation: A constraint satisfaction approach for the architectural synthesis of digital VLSI circuits : proefschrift / door Adwin H. Timmer. [S.l: s.n.,], 1996.
Знайти повний текст джерелаA Constrained Space Exploration Technology Program. Washington, D.C.: National Academies Press, 2008. http://dx.doi.org/10.17226/12471.
Повний текст джерелаAeronautics and Space Engineering Board, National Research Council, Division on Engineering and Physical Sciences, and Committee to Review NASA's Exploration Technology Development Program. Constrained Space Exploration Technology Program: A Review of NASA's Exploration Technology Development Program. National Academies Press, 2008.
Знайти повний текст джерелаAeronautics and Space Engineering Board, National Research Council, Division on Engineering and Physical Sciences, and Committee to Review NASA's Exploration Technology Development Program. Constrained Space Exploration Technology Program: A Review of NASA's Exploration Technology Development Program. National Academies Press, 2009.
Знайти повний текст джерелаAeronautics and Space Engineering Board, National Research Council, Division on Engineering and Physical Sciences, and Committee to Review NASA's Exploration Technology Development Program. Constrained Space Exploration Technology Program: A Review of NASA's Exploration Technology Development Program. National Academies Press, 2008.
Знайти повний текст джерелаЧастини книг з теми "Constrained exploration"
Zhao, Xin, Cheng-Cheng Tang, Yong-Liang Yang, Helmut Pottmann, and Niloy J. Mitra. "Intuitive Design Exploration of Constrained Meshes." In Advances in Architectural Geometry 2012, 305–18. Vienna: Springer Vienna, 2013. http://dx.doi.org/10.1007/978-3-7091-1251-9_25.
Повний текст джерелаDas, Shantanu, Dariusz Dereniowski, and Christina Karousatou. "Collaborative Exploration by Energy-Constrained Mobile Robots." In Structural Information and Communication Complexity, 357–69. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25258-2_25.
Повний текст джерелаWang, Hui, Tie Cai, Yinfeng Wang, Geng Yang, and Junwei Liang. "Manifold Learning Algorithm Based on Constrained Particle Swarm Multi-objective Optimization." In Exploration of Novel Intelligent Optimization Algorithms, 71–80. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-4109-2_8.
Повний текст джерелаVenugopalan, Manju, and Deepa Gupta. "Sentiment Classification for Hindi Tweets in a Constrained Environment Augmented Using Tweet Specific Features." In Mining Intelligence and Knowledge Exploration, 664–70. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26832-3_63.
Повний текст джерелаSaccani, Danilo. "Model Predictive Control for Constrained Navigation of Autonomous Vehicles." In Special Topics in Information Technology, 103–13. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-51500-2_9.
Повний текст джерелаScrbak, Marko, Joseph L. Greathouse, Nuwan Jayasena, and Krishna Kavi. "DVFS Space Exploration in Power Constrained Processing-in-Memory Systems." In Architecture of Computing Systems - ARCS 2017, 221–33. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-54999-6_17.
Повний текст джерелаDisser, Yann, and Max Klimm. "The Space Complexity of Undirected Graph Exploration." In Lecture Notes in Computer Science, 152–66. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_8.
Повний текст джерелаChantrapornchai, Chantana, Wanlop Surakumpolthorn, and Edwin Sha. "Design Exploration Framework Under Impreciseness Based on Register-Constrained Inclusion Scheduling." In Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making, 78–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30502-6_6.
Повний текст джерелаCao, Ruidong, Min Dong, Xuanlu Jiang, Sheng Bi, and Ning Xi. "Long-Horizon Route-Constrained Policy for Learning Continuous Control Without Exploration." In Lecture Notes in Computer Science, 38–49. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-15931-2_4.
Повний текст джерелаWang, Gui-hai, Tong-cui Guo, Hao-chen Li, Chun-qiu Guo, Hong-jun Wang, Jian-xiong Dong, and Liang-jie Zhang. "Thin Reef-Shoal Reservoir Prediction Using Two-Order Microfacies Constrained Geostatistical Inversion." In Proceedings of the International Field Exploration and Development Conference 2021, 1842–52. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2149-0_169.
Повний текст джерелаТези доповідей конференцій з теми "Constrained exploration"
Griffin, Brand Norman. "Lunar Daylight Exploration: Cost Constrained Human and Robotic Exploration." In 12th Biennial International Conference on Engineering, Construction, and Operations in Challenging Environments; and Fourth NASA/ARO/ASCE Workshop on Granular Materials in Lunar and Martian Exploration. Reston, VA: American Society of Civil Engineers, 2010. http://dx.doi.org/10.1061/41096(366)110.
Повний текст джерелаWoodcock, Gordon. "Space Exploration Strategies for Constrained Funding." In AIAA SPACE 2012 Conference & Exposition. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2012. http://dx.doi.org/10.2514/6.2012-5230.
Повний текст джерелаJia, Fan, and Mei Han. "Bayesian optimization considering constrained boundary exploration." In 2023 4th International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE). IEEE, 2023. http://dx.doi.org/10.1109/icbase59196.2023.10303125.
Повний текст джерелаYang, Yong-Liang, Yi-Jun Yang, Helmut Pottmann, and Niloy J. Mitra. "Shape space exploration of constrained meshes." In the 2011 SIGGRAPH Asia Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2024156.2024158.
Повний текст джерелаKnödtel, Johannes, and Marc Reichenbach. "Datapath Optimization for Embedded Signal Processing Architectures utilizing Design Space Exploration." In DroneSE and RAPIDO 2023: System Engineering for constrained embedded systems. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3579170.3579257.
Повний текст джерелаJebali, Fatma, Oumaima Matoussi, Arief Wicaksana, Amir Charif, and Lilia Zaourar. "Decoupling processor and memory hierarchy simulators for efficient design space exploration." In DroneSE and RAPIDO '22: System Engineering for constrained embedded systems. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3522784.3522796.
Повний текст джерелаEscuin, Carlos, Asif Ali Khan, Pablo Ibañez, Teresa Monreal, Victor Viñals, and Jeronimo Castrillon. "HyCSim: A rapid design space exploration tool for emerging hybrid last-level caches." In DroneSE and RAPIDO '22: System Engineering for constrained embedded systems. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3522784.3522801.
Повний текст джерелаCarvalho, J., A. Malehmir, N. Pacheco, F. Marques, P. Dias, G. Donoso, B. Brodic, et al. "Target generations using constrained 3D gravity inversion and innovative in-mine-surface seismic surveys, Neves-Corvo, Portugal." In Mineral Exploration Symposium. European Association of Geoscientists & Engineers, 2020. http://dx.doi.org/10.3997/2214-4609.202089016.
Повний текст джерелаHasanzadeZonuzy, Aria, Dileep Kalathil, and Srinivas Shakkottai. "Model-Based Reinforcement Learning for Infinite-Horizon Discounted Constrained Markov Decision Processes." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/347.
Повний текст джерелаRamaithititima, Rattanachai, and Subhrajit Bhattacharya. "Landmark-based Exploration with Swarm of Resource Constrained Robots." In 2018 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2018. http://dx.doi.org/10.1109/icra.2018.8460884.
Повний текст джерелаЗвіти організацій з теми "Constrained exploration"
Rice, J., R. C. Paulen, M. Ross, M. B. McClenaghan, and H. E. Campbell. Quaternary geology of the southern Core Zone area, Quebec and Newfoundland and Labrador. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331426.
Повний текст джерелаRice, J. M., R. C. Paulen, M. Ross, M. B. McClenaghan, and H E Campbell. Quaternary geology of the south Core Zone area, Quebec and Labrador. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330903.
Повний текст джерелаRice, J. M., M. Ross, H E Campbell, R. C. Paulen, and M. B. McClenaghan. Net evolution of subglacial sediment transport in the Quebec-Labrador Sector of the Laurentide Ice Sheet, Quebec and Newfoundland and Labrador. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/332151.
Повний текст джерелаBerndt, Christian. RV SONNE Fahrtbericht / Cruise Report SO277 OMAX: Offshore Malta Aquifer Exploration, Emden (Germany) – Emden (Germany), 14.08. – 03.10.2020. GEOMAR Helmholtz Centre for Ocean Research Kiel, January 2021. http://dx.doi.org/10.3289/geomar_rep_ns_57_20.
Повний текст джерелаThomas, Douglas, and Mellon Michael. Sublimation of terrestrial permafrost and the implications for ice-loss processes on Mars. Engineer Research and Development Center (U.S.), July 2021. http://dx.doi.org/10.21079/11681/41244.
Повний текст джерелаD'Acosta, Michael, Karl Alexander Melgarejo, and Valerie Mercer-Blackman. Policy Benchmarking for Productivity and Growth: Review and Proposed Framework for the Caribbean. Inter-American Development Bank, September 2013. http://dx.doi.org/10.18235/0009131.
Повний текст джерелаde Caritat, Patrice, Brent McInnes, and Stephen Rowins. Towards a heavy mineral map of the Australian continent: a feasibility study. Geoscience Australia, 2020. http://dx.doi.org/10.11636/record.2020.031.
Повний текст джерелаMcMartin, I., M. S. Gauthier, and A. V. Page. Updated post-glacial marine limits along western Hudson Bay, central mainland Nunavut and northern Manitoba. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330940.
Повний текст джерелаFerguson, Thomas, and Servaas Storm. Myth and Reality in the Great Inflation Debate: Supply Shocks and Wealth Effects in a Multipolar World Economy. Institute for New Economic Thinking Working Paper Series, January 2023. http://dx.doi.org/10.36687/inetwp196.
Повний текст джерела