{"id":"https://openalex.org/W7127636115","doi":"https://doi.org/10.48550/arxiv.2602.02846","title":"Kino-PAX$^+$: Near-Optimal Massively Parallel Kinodynamic Sampling-based Motion Planner","display_name":"Kino-PAX$^+$: Near-Optimal Massively Parallel Kinodynamic Sampling-based Motion Planner","publication_year":2026,"publication_date":"2026-02-02","ids":{"openalex":"https://openalex.org/W7127636115","doi":"https://doi.org/10.48550/arxiv.2602.02846"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.02846","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010848637","display_name":"Nicolas Perrault","orcid":"https://orcid.org/0000-0002-7357-8415"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Perrault, Nicolas","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020888957","display_name":"Qi Heng Ho","orcid":"https://orcid.org/0009-0006-0743-9341"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ho, Qi Heng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069564559","display_name":"Morteza Lahijanian","orcid":"https://orcid.org/0000-0001-7549-4365"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lahijanian, Morteza","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010848637"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.9478999972343445,"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":0.9478999972343445,"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/T12290","display_name":"Human Motion and Animation","score":0.007600000128149986,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.006000000052154064,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/massively-parallel","display_name":"Massively parallel","score":0.6618000268936157},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6492999792098999},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5091999769210815},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4442000091075897},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.44179999828338623},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4050000011920929},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.37209999561309814}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7046999931335449},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6618000268936157},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6492999792098999},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40700000524520874},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4027000069618225},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4016000032424927},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.25619998574256897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2558000087738037},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.02846","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.02846","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.02846","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.02846","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7550185322761536}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Sampling-based":[0],"motion":[1,9],"planners":[2],"(SBMPs)":[3],"are":[4],"widely":[5],"used":[6],"for":[7,97],"robot":[8],"planning":[10],"with":[11,62],"complex":[12],"kinodynamic":[13,60],"constraints":[14],"in":[15,40],"high-dimensional":[16],"spaces,":[17],"yet":[18],"they":[19,45],"struggle":[20],"to":[21,26,33,132],"achieve":[22],"\\emph{real-time}":[23],"performance":[24],"due":[25],"their":[27],"serial":[28,78,140],"computation":[29,88],"design.":[30],"Recent":[31],"efforts":[32],"parallelize":[34],"SBMPs":[35],"have":[36],"achieved":[37],"significant":[38],"speedups":[39],"finding":[41],"feasible":[42,73],"solutions;":[43],"however,":[44],"provide":[46],"no":[47],"guarantees":[48],"of":[49,71,104,135],"optimizing":[50],"an":[51],"objective":[52],"function.":[53],"We":[54,107],"introduce":[55],"Kino-PAX$^{+}$,":[56],"a":[57,68,148],"massively":[58,82],"parallel":[59,83],"SBMP":[61],"asymptotic":[63,121],"near-optimal":[64],"guarantees.":[65],"Kino-PAX$^{+}$":[66,128],"builds":[67],"sparse":[69],"tree":[70],"dynamically":[72],"trajectories":[74],"by":[75],"decomposing":[76],"traditionally":[77],"operations":[79],"into":[80],"three":[81,133],"subroutines.":[84],"The":[85],"algorithm":[86],"focuses":[87],"on":[89,117],"the":[90],"most":[91],"promising":[92,118],"nodes":[93,119],"within":[94],"local":[95],"neighborhoods":[96],"propagation":[98],"and":[99,142],"refinement,":[100],"enabling":[101],"rapid":[102],"improvement":[103],"solution":[105,145],"cost.":[106],"prove":[108],"that,":[109],"while":[110],"maintaining":[111],"probabilistic":[112],"$\u03b4$-robust":[113,122],"completeness,":[114],"this":[115],"focus":[116],"ensures":[120],"near-optimality.":[123],"Our":[124],"results":[125],"show":[126],"that":[127],"finds":[129],"solutions":[130],"up":[131],"orders":[134],"magnitude":[136],"faster":[137],"than":[138,147],"existing":[139],"methods":[141],"achieves":[143],"lower":[144],"costs":[146],"state-of-the-art":[149],"GPU-based":[150],"planner.":[151]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-06T00:00:00"}