{"id":"https://openalex.org/W1977473135","doi":"https://doi.org/10.1016/0921-8890(96)80512-4","title":"On shortest paths for a car-like robot maneuvering around obstacles","display_name":"On shortest paths for a car-like robot maneuvering around obstacles","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W1977473135","doi":"https://doi.org/10.1016/0921-8890(96)80512-4","mag":"1977473135"},"language":"en","primary_location":{"id":"doi:10.1016/0921-8890(96)80512-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0921-8890(96)80512-4","pdf_url":null,"source":{"id":"https://openalex.org/S133768115","display_name":"Robotics and Autonomous Systems","issn_l":"0921-8890","issn":["0921-8890","1872-793X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotics and Autonomous 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/A5020707737","display_name":"Guy Desaulniers","orcid":"https://orcid.org/0000-0003-4469-9813"},"institutions":[{"id":"https://openalex.org/I4210133247","display_name":"Group for Research in Decision Analysis","ror":"https://ror.org/02pkvpx84","country_code":"CA","type":"facility","lineage":["https://openalex.org/I108192572","https://openalex.org/I159129438","https://openalex.org/I4210133247","https://openalex.org/I45683168","https://openalex.org/I49663120","https://openalex.org/I5023651"]},{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Guy Desaulniers","raw_affiliation_strings":["GERAD and Ecole Polytechnique de Montr\u00e9al, 5255 av. Decelles, Montr\u00e9al, Qu\u00e9bec, Canada H3T 1V6"],"affiliations":[{"raw_affiliation_string":"GERAD and Ecole Polytechnique de Montr\u00e9al, 5255 av. Decelles, Montr\u00e9al, Qu\u00e9bec, Canada H3T 1V6","institution_ids":["https://openalex.org/I45683168","https://openalex.org/I4210133247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020707737"],"corresponding_institution_ids":["https://openalex.org/I4210133247","https://openalex.org/I45683168"],"apc_list":{"value":3020,"currency":"USD","value_usd":3020},"apc_paid":null,"fwci":0.9949,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.75928763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":"3","first_page":"139","last_page":"148"},"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.996999979019165,"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/T12288","display_name":"Optimization and Search Problems","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.789567232131958},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7447795867919922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7206562757492065},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6848120093345642},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5997087955474854},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5857691168785095},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.583081841468811},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5464561581611633},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4767818748950958},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4699825346469879},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4689317047595978},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4463115930557251},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44129911065101624},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4382122755050659},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.40493708848953247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4044913649559021},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2651982605457306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2211001217365265},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.17726442217826843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17156195640563965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12815386056900024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.068036288022995},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06716111302375793},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06131318211555481}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.789567232131958},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7447795867919922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7206562757492065},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6848120093345642},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5997087955474854},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5857691168785095},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.583081841468811},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5464561581611633},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4767818748950958},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4699825346469879},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4689317047595978},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4463115930557251},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44129911065101624},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4382122755050659},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.40493708848953247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4044913649559021},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2651982605457306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2211001217365265},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.17726442217826843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17156195640563965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12815386056900024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.068036288022995},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06716111302375793},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06131318211555481},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0921-8890(96)80512-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0921-8890(96)80512-4","pdf_url":null,"source":{"id":"https://openalex.org/S133768115","display_name":"Robotics and Autonomous Systems","issn_l":"0921-8890","issn":["0921-8890","1872-793X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotics and Autonomous Systems","raw_type":"journal-article"},{"id":"pmh:oai:publications.polymtl.ca:31366","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/31366/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W81972633","https://openalex.org/W101508493","https://openalex.org/W1971998222","https://openalex.org/W2112057080","https://openalex.org/W2148970883","https://openalex.org/W2152053668","https://openalex.org/W2158380902","https://openalex.org/W2166034910","https://openalex.org/W2170508483","https://openalex.org/W2313274380","https://openalex.org/W2622326378","https://openalex.org/W6603271479","https://openalex.org/W6665360687","https://openalex.org/W6674869844","https://openalex.org/W6676602635","https://openalex.org/W6677450168","https://openalex.org/W6681926931","https://openalex.org/W6683333814","https://openalex.org/W6684120708","https://openalex.org/W6685108414","https://openalex.org/W6738607951"],"related_works":["https://openalex.org/W2347245430","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2018146256","https://openalex.org/W2009815020","https://openalex.org/W2040572217","https://openalex.org/W2352094194","https://openalex.org/W2348504720","https://openalex.org/W2612665926"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}