{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:52:14Z","timestamp":1725472334225},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490265"},{"type":"electronic","value":"9783540490586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925231_110","type":"book-chapter","created":{"date-parts":[[2006,11,6]],"date-time":"2006-11-06T09:48:34Z","timestamp":1162806514000},"page":"1150-1159","source":"Crossref","is-referenced-by-count":5,"title":["Exploring Unknown Environments with Randomized Strategies"],"prefix":"10.1007","author":[{"given":"Judith","family":"Espinoza","sequence":"first","affiliation":[]},{"given":"Abraham","family":"S\u00e1nchez","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Osorio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"Oriolo, G., Vendittelli, M., Freda, L., Troso, G.: The SRT method: Randomized strategies for exploration. In: IEEE Int. Conf. on Robotics and Automation, pp. 4688\u20134694 (2004)","DOI":"10.1109\/ROBOT.2004.1302457"},{"key":"110_CR2","volume-title":"Proc. of the Thirteenth National Conference on Artificial Intelligence","author":"S. Koenig","year":"1996","unstructured":"Koenig, S.: Agent-centered search: Situated search with small look-ahead. In: Proc. of the Thirteenth National Conference on Artificial Intelligence, AAAI Press, Menlo Park (1996)"},{"key":"110_CR3","unstructured":"Stentz, A.: The D* algorithm for real-time planning of optimal traverses. Technical Report CMU-RI-TR-94-37, Carnegie Mellon University Robotics Institute (1994)"},{"key":"110_CR4","unstructured":"LaValle, S.M.: Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University (1998)"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., LaValle, S.M.: RRT-connect: An efficient approach to single-query path planning. In: IEEE Int. Conf. on Robotics and Automation, pp. 995\u20131001 (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"110_CR6","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Workshop on Algorithmic Foundations of Robotics (2000)"},{"issue":"5","key":"110_CR7","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"S.M. LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. International Journal of Robotics Research\u00a020(5), 378\u2013400 (2001)","journal-title":"International Journal of Robotics Research"},{"key":"110_CR8","unstructured":"Judith, E.L.: Estrategias para la exploraci\u00f3n de ambientes desconocidos en rob\u00f3tica m\u00f3vil. Master Thesis, FCC-BUAP (in spanish) (2006)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925231_110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:45:21Z","timestamp":1619495121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925231_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490265","9783540490586"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11925231_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}