{"id":"https://openalex.org/W4388286377","doi":"https://doi.org/10.1109/lra.2023.3330050","title":"Kinodynamic Motion Planning via Branch-and-Cut Over Probabilistic Roadmaps","display_name":"Kinodynamic Motion Planning via Branch-and-Cut Over Probabilistic Roadmaps","publication_year":2023,"publication_date":"2023-11-03","ids":{"openalex":"https://openalex.org/W4388286377","doi":"https://doi.org/10.1109/lra.2023.3330050"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2023.3330050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3330050","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","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/A5069041202","display_name":"Miquel Ram\u00edrez","orcid":"https://orcid.org/0000-0002-1838-7982"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Miquel Ramirez","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-1838-7982","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043555898","display_name":"Daniel Selvaratnam","orcid":"https://orcid.org/0000-0003-3329-436X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Daniel Selvaratnam","raw_affiliation_strings":["Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-3329-436X","affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020178903","display_name":"Chris Manzie","orcid":"https://orcid.org/0000-0002-9969-0982"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chris Manzie","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9969-0982","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069041202"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.705,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7279027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"247","last_page":"254"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9919000267982483,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9837999939918518,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6175633072853088},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6149126291275024},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.60735023021698},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5623593330383301},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5318752527236938},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.505003035068512},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4984872341156006},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.492118775844574},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.49111029505729675},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48917534947395325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47758033871650696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45062851905822754},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.4314683973789215},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4183098077774048},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4144873023033142},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1771889328956604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15036198496818542}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6175633072853088},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6149126291275024},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.60735023021698},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5623593330383301},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5318752527236938},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.505003035068512},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4984872341156006},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.492118775844574},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.49111029505729675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48917534947395325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47758033871650696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45062851905822754},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.4314683973789215},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4183098077774048},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4144873023033142},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1771889328956604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15036198496818542},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2023.3330050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3330050","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1424654272","https://openalex.org/W1587371456","https://openalex.org/W1587861032","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1990564835","https://openalex.org/W1996286784","https://openalex.org/W2048820947","https://openalex.org/W2054585537","https://openalex.org/W2069667928","https://openalex.org/W2075887074","https://openalex.org/W2128990851","https://openalex.org/W2132467020","https://openalex.org/W2142224528","https://openalex.org/W2158970477","https://openalex.org/W2159722616","https://openalex.org/W2205716527","https://openalex.org/W2479748687","https://openalex.org/W2614971498","https://openalex.org/W2784322399","https://openalex.org/W2949117375","https://openalex.org/W2955697550","https://openalex.org/W2968945909","https://openalex.org/W3090404636","https://openalex.org/W3102121895","https://openalex.org/W3105161877","https://openalex.org/W3122878979","https://openalex.org/W3173319085","https://openalex.org/W3177356943","https://openalex.org/W3209819041","https://openalex.org/W4211176451","https://openalex.org/W4236470048","https://openalex.org/W4241051765","https://openalex.org/W4249885861","https://openalex.org/W4250589301","https://openalex.org/W4285744157","https://openalex.org/W4293179730","https://openalex.org/W4296246237","https://openalex.org/W4298290503","https://openalex.org/W6665145699","https://openalex.org/W6688069792","https://openalex.org/W6713184877","https://openalex.org/W7064096428"],"related_works":["https://openalex.org/W93625746","https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W4308217561","https://openalex.org/W2134348961","https://openalex.org/W2115192598","https://openalex.org/W2364686755"],"abstract_inverted_index":{"This":[0],"letter":[1],"describes":[2],"an":[3],"extension":[4],"of":[5,105,130,133],"the":[6,38,91,102,110,123,131],"classic":[7],"Lazy":[8],"Probabilistic":[9],"Roadmaps":[10],"algorithm":[11,83],"(Lazy":[12],"PRM),":[13],"which":[14],"results":[15],"from":[16],"pairing":[17],"PRM":[18],"and":[19,59],"a":[20,73,80,95],"novel":[21],"Branch-and-Cut":[22],"(BC)":[23],"algorithm.":[24],"Cuts":[25,44],"are":[26,31,77],"dynamically":[27],"generated":[28],"constraints":[29],"that":[30,47,54,84],"imposed":[32],"on":[33],"minimum":[34],"cost":[35],"paths":[36,46],"over":[37,122],"geometric":[39,58],"graphs":[40],"selected":[41],"by":[42,67,109],"PRM.":[43],"eliminate":[45],"cannot":[48],"be":[49],"mapped":[50],"into":[51,87],"smooth":[52,65],"plans":[53,66],"satisfy":[55],"suitably":[56],"defined":[57],"differential":[60],"constraints.":[61],"We":[62,115],"generate":[63],"candidate":[64],"fitting":[68],"splines":[69],"to":[70,93],"vertices":[71],"in":[72],"minimum-cost":[74],"path.":[75],"Plans":[76],"validated":[78],"with":[79],"recently":[81,124],"proposed":[82,125],"maps":[85],"them":[86],"finite":[88],"traces,":[89],"without":[90],"need":[92],"choose":[94],"fixed":[96],"discretization":[97],"step.":[98],"A":[99],"trace":[100],"records":[101],"exact":[103],"sequence":[104],"constraint":[106],"boundaries":[107],"crossed":[108],"plan,":[111],"modulo":[112],"arithmetic":[113],"precision.":[114],"evaluate":[116],"several":[117],"planners":[118],"using":[119],"our":[120,134],"methods":[121],"BARN":[126],"benchmark,":[127],"reporting":[128],"evidence":[129],"scalability":[132],"approach.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}