{"id":"https://openalex.org/W8369482","doi":null,"title":"A Guide to Heuristic-based Path Planning","display_name":"A Guide to Heuristic-based Path Planning","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W8369482","mag":"8369482"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.2544","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.2544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ri.cmu.edu/pub_files/pub4/ferguson_david_2005_2/ferguson_david_2005_2.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110331104","display_name":"Dave Ferguson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dave Ferguson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103257510","display_name":"Maxim A. Likhachev","orcid":"https://orcid.org/0000-0002-9539-2398","observed_orcids":["https://orcid.org/0000-0002-9539-2398"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maxim Likhachev","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9539-2398","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035860678","display_name":"Anthony Stentz","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony Stentz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.986,"has_fulltext":false,"cited_by_count":225,"citation_normalized_percentile":{"value":0.95345705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.7749999761581421},{"id":"https://openalex.org/keywords/d","display_name":"D\u00d8","score":0.8169999718666077},{"id":"https://openalex.org/keywords/ara","display_name":"ARA","score":0.9480000138282776},{"id":"https://openalex.org/keywords/ad","display_name":"Ad ...","score":0.9710000157356262},{"id":"https://openalex.org/keywords/anytime-algorithms","display_name":"anytime algorithms","score":0.9330000281333923},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"robot navigation","score":0.5379999876022339},{"id":"https://openalex.org/keywords/motion-planning","display_name":"motion planning","score":0.44200000166893005}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6936439871788025},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.660555899143219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6306942701339722},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5999674797058105},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5630677938461304},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4531559944152832},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3385440409183502},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29700320959091187},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08129477500915527}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.2544","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.2544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ri.cmu.edu/pub_files/pub4/ferguson_david_2005_2/ferguson_david_2005_2.pdf","raw_type":"text"},{"id":"mag:8369482","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.cmu.edu/~maxim/files/hsplanguide_icaps05ws.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W196834341","https://openalex.org/W198732646","https://openalex.org/W1508405818","https://openalex.org/W1515226261","https://openalex.org/W1536029484","https://openalex.org/W1575990843","https://openalex.org/W1763528081","https://openalex.org/W1969483458","https://openalex.org/W1980840834","https://openalex.org/W2009833344","https://openalex.org/W2029706450","https://openalex.org/W2030874472","https://openalex.org/W2037348066","https://openalex.org/W2050019941","https://openalex.org/W2099144379","https://openalex.org/W2115240791","https://openalex.org/W2122054842","https://openalex.org/W2128990851","https://openalex.org/W2130338305","https://openalex.org/W2138245305","https://openalex.org/W2141161225","https://openalex.org/W2152475379","https://openalex.org/W2154968336","https://openalex.org/W2158137377","https://openalex.org/W2161076907","https://openalex.org/W2169528473","https://openalex.org/W2341171179","https://openalex.org/W2567571404","https://openalex.org/W2590050186","https://openalex.org/W2611243847"],"related_works":["https://openalex.org/W7099179748","https://openalex.org/W4386963175","https://openalex.org/W198732646","https://openalex.org/W2545041947","https://openalex.org/W3126963788","https://openalex.org/W4400062131","https://openalex.org/W99943456","https://openalex.org/W3111506969","https://openalex.org/W2145089737","https://openalex.org/W2130403814"],"abstract_inverted_index":{"We":[0,17,41],"describe":[1],"a":[2],"family":[3],"of":[4,48],"recently":[5],"developed":[6],"heuristicbased":[7],"algorithms":[8,24,28,32,38],"used":[9],"for":[10],"path":[11],"planning":[12],"in":[13],"the":[14,19,43],"real":[15,54],"world.":[16],"discuss":[18,50],"fundamental":[20],"similarities":[21],"between":[22],"static":[23],"(e.g.":[25,29,33,39],"A*),":[26],"replanning":[27,37],"D*),":[30],"anytime":[31,36],"ARA*),":[34],"and":[35,57,62],"AD*).":[40],"introduce":[42],"motivation":[44],"behind":[45],"each":[46],"class":[47],"algorithms,":[49],"their":[51,59],"use":[52],"on":[53],"robotic":[55],"systems,":[56],"highlight":[58],"practical":[60],"benefits":[61],"disadvantages.":[63]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":35},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":26},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":13}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}