{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:44:07Z","timestamp":1760597047299},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0950-7051(01)00121-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:58:12Z","timestamp":1027591092000},"page":"53-66","source":"Crossref","is-referenced-by-count":16,"title":["Hierarchical A\u2217 based path planning \u2014 a case study"],"prefix":"10.1016","volume":"15","author":[{"given":"Antti","family":"Autere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0950-7051(01)00121-6_BIB1","unstructured":"A. Autere. A\u2217 as an optimal resource allocation policy in path finding problems. In: The 14th International FLAIRS Conference, Key West, Florida, May 21\u201323 (2001) 139\u2013144. In cooperation with The American Association for Artificial Intelligence."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB2","first-page":"1208","article-title":"Robot motion planning by A\u2217 search on a modified discretized configuration space","volume":"September 7\u201311","author":"Autere","year":"1997","journal-title":"IEEE\/RSJ Int. Conf. Intelligent Robots Syst. (IROS\u201997)"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB3","first-page":"799","article-title":"A subdivision algorithm in configuration space for findpath with rotation","author":"Brooks","year":"1983","journal-title":"8th Int. Joint Conf. Artificial Intelligence, Karlsruhe, Germany"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB4","doi-asserted-by":"crossref","unstructured":"B. Clavina, Solving findpath by combination of goal-directed and randomized search, IEEE Int. Conf. Robotics Automation, Cincinnati, OH, May 13\u201318 (1990) 1718\u20131723.","DOI":"10.1109\/ROBOT.1990.126257"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB5","doi-asserted-by":"crossref","unstructured":"C.I. Connolly, J.B. Burns, R. Weiss, Path planning using Laplace's equation, EEE Int. Conf. Robotics Automation, Cincinnati, OH, May 13\u201318 (1990) 2102\u20132106.","DOI":"10.1109\/ROBOT.1990.126315"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB6","unstructured":"Rina Dechter, Judea Pearl. The optimality of A\u2217 revisited. In: Third AAAI Natl. Confernece on AI, Washington D.C., 1983, 95\u201399."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB7","first-page":"1732","article-title":"Path planning using a Jacobian-based freespace generation algorithm","author":"Paden","year":"1989","journal-title":"IEEE Int. Conf. Robotics Automation, Washington"},{"issue":"2","key":"10.1016\/S0950-7051(01)00121-6_BIB8","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning: a configuration space approach","volume":"C-32","author":"Lozano-Peres","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB9","article-title":"Obbtree: a hierarchical structure for rapid interference detection","volume":"August 4\u20139","author":"Gottschalk","year":"1996","journal-title":"Comput. Graphics Proc., SIGGRAPH 96"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"basis for the heuristic determination on minimum cost paths","volume":"2","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cyber."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB11","doi-asserted-by":"crossref","unstructured":"Th. Horsch, F. Schwarz, H. Tolle, Motion planning with many degrees of freedom \u2014 random reflections at c-space obstacles, IEEE Int. Conf. Robotics Automation, San Diego, CA, May 8\u201313 (1994) 3318\u20133323.","DOI":"10.1109\/ROBOT.1994.351060"},{"issue":"3","key":"10.1016\/S0950-7051(01)00121-6_BIB12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/136035.136037","article-title":"Gross motion planning \u2014 a survey","volume":"24","author":"Hwang","year":"1992","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB13","doi-asserted-by":"crossref","unstructured":"F. Janabi-Sharifi, D. Vinke, Integration of the artificial potential field approach with simulated annealing for robot path planning, IEEE Int. Symp. Intelligent Control, Chicago, Illinois, USA August (1993) 536\u2013541.","DOI":"10.1109\/ISIC.1993.397640"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB14","unstructured":"L. Kavraki, J.-C. Latombe, Randomized preprosessing of configuration space for fast path planning, IEEE Int. Conf. Robotics Automation, San Diego, CA, May 8\u201313 (1994) 2138\u20132145."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB15","unstructured":"J.-C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Dordrecht, Third printing, 1993."},{"key":"10.1016\/S0950-7051(01)00121-6_BIB16","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB17","series-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB18","doi-asserted-by":"crossref","unstructured":"E. Ralli, G. Hirzinger, Fast path planning for robot manipulators using numerical potential fields in the configuration space, IEEE\/RSJ Int. Conf. Intelligent Robotics Syst. (IROS\u201994) Munich, Germany, September 12\u201316, (1994).","DOI":"10.1109\/IROS.1994.407663"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB19","doi-asserted-by":"crossref","unstructured":"L Tarassenko, A. Blake, Analogue computation of collision-free paths, IEEE Int. Conf. Robotics Automation, Sacramento, CA, April 9\u201311, (1991).","DOI":"10.1109\/ROBOT.1991.131636"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB20","doi-asserted-by":"crossref","unstructured":"C.W. Warren, Fast path planning using modified A\u2217 method, IEEE Int. Conf. Robotics Automation, Atlanta, GA, May 2\u20136 (1993) 662\u2013667.","DOI":"10.1109\/ROBOT.1993.291883"},{"key":"10.1016\/S0950-7051(01)00121-6_BIB21","unstructured":"http:\/\/www.cs.hut.fi\/\u223chcjake\/path-planning\/"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705101001216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705101001216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T18:22:40Z","timestamp":1556475760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705101001216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0950705101001216"],"URL":"https:\/\/doi.org\/10.1016\/s0950-7051(01)00121-6","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}