{"id":"https://openalex.org/W1934130465","doi":"https://doi.org/10.1023/a:1008070923246","title":"A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots","display_name":"A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W1934130465","doi":"https://doi.org/10.1023/a:1008070923246","mag":"1934130465"},"language":"en","primary_location":{"id":"doi:10.1023/a:1008070923246","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008070923246","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent and Robotic Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5066860952","display_name":"Kaichun Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kaichun Jiang","raw_affiliation_strings":["Manufacturing Engineering and Industrial Management, Department of Engineering, The University of Liverpool, Liverpool, L69 3BX, UK","Manufacturing Engineering and Industrial Management, Department of Engineering, The University of Liverpool,Liverpool L69 3BX, UK; e- mail: kaichun@liverpool.ac.uk#TAB#"],"affiliations":[{"raw_affiliation_string":"Manufacturing Engineering and Industrial Management, Department of Engineering, The University of Liverpool, Liverpool, L69 3BX, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"Manufacturing Engineering and Industrial Management, Department of Engineering, The University of Liverpool,Liverpool L69 3BX, UK; e- mail: kaichun@liverpool.ac.uk#TAB#","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074862138","display_name":"Lakmal Seneviratne","orcid":"https://orcid.org/0000-0001-6405-8402"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lakmal D. Seneviratne","raw_affiliation_strings":["Department of Mechanical Engineering, King's College London, Strand, London, WC2R 2LS, UK","Department of Mechanical Engineering, King\u2019s College  London, Strand, London WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, King's College London, Strand, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Mechanical Engineering, King\u2019s College  London, Strand, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076193073","display_name":"S.W.E. Earles","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"S. W. E. Earles","raw_affiliation_strings":["Department of Mechanical Engineering, King's College London, Strand, London, WC2R 2LS, UK","Department of Mechanical Engineering, King\u2019s College  London, Strand, London WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, King's College London, Strand, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Mechanical Engineering, King\u2019s College  London, Strand, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066860952"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.9997,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.86078753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"4","first_page":"347","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9940999746322632,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6717622876167297},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6598085761070251},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.654126763343811},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6417863965034485},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6185380816459656},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.6089949607849121},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5829840302467346},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5410867929458618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5091652274131775},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.4580404460430145},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.45146727561950684},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4507444500923157},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.4504939615726471},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4249246120452881},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4088226854801178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3595898747444153},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3484225273132324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3436056077480316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2906610667705536},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1163230836391449},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07416144013404846}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6717622876167297},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6598085761070251},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.654126763343811},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6417863965034485},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6185380816459656},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.6089949607849121},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5829840302467346},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5410867929458618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5091652274131775},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.4580404460430145},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.45146727561950684},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4507444500923157},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.4504939615726471},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4249246120452881},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4088226854801178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3595898747444153},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3484225273132324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3436056077480316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2906610667705536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1163230836391449},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07416144013404846},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1008070923246","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008070923246","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent and Robotic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1498792794","https://openalex.org/W1526351240","https://openalex.org/W1584021569","https://openalex.org/W1654807447","https://openalex.org/W2016584965","https://openalex.org/W2104761885","https://openalex.org/W2115632170","https://openalex.org/W2117086819","https://openalex.org/W2124310283","https://openalex.org/W2138462423","https://openalex.org/W2148970883","https://openalex.org/W2150500908","https://openalex.org/W2163042598","https://openalex.org/W2166622402","https://openalex.org/W4251794413"],"related_works":["https://openalex.org/W2614449343","https://openalex.org/W2163318972","https://openalex.org/W2758202899","https://openalex.org/W3111684308","https://openalex.org/W3021321022","https://openalex.org/W2315143898","https://openalex.org/W2377984516","https://openalex.org/W786272118","https://openalex.org/W2277626332","https://openalex.org/W1934130465"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}