{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:02:21Z","timestamp":1757311341964,"version":"3.40.3"},"publisher-location":"London","reference-count":21,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447147381"},{"type":"electronic","value":"9781447147398"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-1-4471-4739-8_10","type":"book-chapter","created":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T07:27:13Z","timestamp":1351582033000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Run-Time Analysis of Classical Path-Planning Algorithms"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Mu\u00f1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Barrero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda D.","family":"R-Moreno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,9]]},"reference":[{"key":"10_CR1","unstructured":"G. Ayorkor, A. Stentz, and M. B. Dias. Continuous-field path planning with constrained pathdependent state variables. In ICRA 2008 Workshop on Path Planning on Costmaps, May 2008."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","volume":"5","author":"R Barr","year":"1993","unstructured":"R. Barr and B. Hickman. Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts\u2019 Opinions. ORSA Journal on Computing, 5:2\u20132, 1993.","journal-title":"ORSA Journal on Computing"},{"key":"10_CR3","unstructured":"D. F. Barrero, B. Casta\u02dcno, M. D. R-Moreno, and D. Camacho. Statistical Distribution of Generation-to-Success in GP: Application to Model Accumulated Success Probability. In Proceedings of the 14th European Conference on Genetic Programming, (EuroGP 2011), volume 6621 of LNCS, pages 155\u2013166, Turin, Italy, 27-29 Apr. 2011. Springer Verlag."},{"key":"10_CR4","first-page":"1","volume":"1","author":"A Botea","year":"2004","unstructured":"A. Botea, M. Muller, and J. Schaeffer. Near optimal hierarchical path-finding. Journal of Game Development, 1:1\u201322, 2004.","journal-title":"Journal of Game Development"},{"key":"10_CR5","unstructured":"M. Chiarandini and T. St\u2025utzle. Experimental Evaluation of Course Timetabling Algorithms. Technical Report AIDA-02-05, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany, April 2002."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"K Daniel","year":"2010","unstructured":"K. Daniel, A. Nash, S. Koenig, and A. Felner. Theta*: Any-angle path planning on grids. Journal of Artificial Intelligence Research, 39:533\u2013579, 2010.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10_CR7","unstructured":"S. Epstein and X. Yun. From Unsolvable to Solvable: An Exploration of Simple Changes. In Workshops at the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"M. Erdmann and T. Lozano-Perez. On multiple moving objects. Algorithmica, 2:477\u2013521, 1987.","journal-title":"Algorithmica"},{"key":"10_CR9","unstructured":"D. Ferguson and A. Stentz. Field D*: An interpolation-based path planner and replanner. In Proceedings of the International Symposium on Robotics Research (ISRR), October 2005."},{"key":"10_CR10","unstructured":"D. Frost, I. Rish, and L. Vila. Summarizing CSP Hardness with Continuous Probability Distributions. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence (AAAI\u201997\/IAAI\u201997), pages 327\u2013333. AAAI Press, 1997."},{"issue":"4","key":"10_CR11","first-page":"178","volume":"2","author":"O Hachour","year":"2008","unstructured":"O. Hachour. Path planning of autonomous mobile robot. International Journal of Systems, Applications, Engineering & Development, 2(4):178\u2013190, 2008.","journal-title":"International Journal of Systems, Applications, Engineering & Development"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics., 4:100\u2013107, 1968.","journal-title":"IEEE Transactions on Systems Science and Cybernetics."},{"key":"10_CR13","unstructured":"H. Hoos and T. St\u2025utzle. Characterizing the Run-Time Behavior of Stochastic Local Search. In Proceedings AAAI99, 1998."},{"issue":"1-2","key":"10_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H. Hoos","year":"1999","unstructured":"H. Hoos and T. St\u2025utzle. Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. Artificial Intelligence, 112(1-2):213\u2013232, 1999.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10_CR15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H. Hoos","year":"2000","unstructured":"H. Hoos and T. St\u2025utzle. Local Search Algorithms for SAT: An Empirical Evaluation. Journal of Automated Reasoning, 24(4):421\u2013481, 2000.","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR16","unstructured":"H. H. Hoos and T. St\u2025utzle. Evaluating Las Vegas Algorithms \u2013 Pitfalls and Remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 238\u2013245. Morgan Kaufmann Publishers, 1998."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"I. Millington and J. Funge. Artificial Intelligence for Games. Morgan Kaufmann Publishers, 2 edition, 2009.","DOI":"10.1016\/B978-0-12-374731-0.00008-6"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"P. Mu\u02dcnoz and M. D. R-Moreno. S-Theta*: low steering path-planning algorithm. In Thirtysecond SGAI International Conference on Artificial Intelligence (AI-2012), Cambridge, UK, 2012.","DOI":"10.1007\/978-1-4471-4739-8_8"},{"key":"10_CR19","unstructured":"A. Nash, K. Daniel, S. Koenig, and A. Felner. Theta*: Any-angle path planning on grids. In In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 1177\u20131183, 2007."},{"key":"10_CR20","unstructured":"N. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto, CA. ISBN 0-935382-01-1, 1980."},{"key":"10_CR21","unstructured":"K. Sugihara and J. Smith. A genetic algorithm for 3-d path planning of a mobile robot. Technical report, Tech. Rep. No. 96-09-01. Software Engineering Research Laboratory,University of Hawaii at Manoa, 1996."}],"container-title":["Research and Development in Intelligent Systems XXIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4739-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:42:27Z","timestamp":1676785347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4739-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9781447147381","9781447147398"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4739-8_10","relation":{},"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"9 October 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}