{"id":"https://openalex.org/W4379473837","doi":"https://doi.org/10.48550/arxiv.2306.01301","title":"Nonholonomic Motion Planning as Efficient as Piano Mover's","display_name":"Nonholonomic Motion Planning as Efficient as Piano Mover's","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4379473837","doi":"https://doi.org/10.48550/arxiv.2306.01301"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2306.01301","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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"posted-content","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2306.01301","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022721299","display_name":"D. Nist\u00e9r","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nister, David","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114055475","display_name":"Jaikrishna Soundararajan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soundararajan, Jaikrishna","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100602395","display_name":"Yizhou Wang","orcid":"https://orcid.org/0000-0001-9888-6409"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yizhou","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026619242","display_name":"H.S. Sane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sane, Harshad","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":67},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986,"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.9986,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.986,"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"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9461,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.50997317},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45676896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43802232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3986172},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36555266},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35499102}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2306.01301","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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.01301","pdf_url":"http://arxiv.org/pdf/2306.01301","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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.2306.01301","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2306.01301","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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"score":0.74,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3002753104","https://openalex.org/W2600246793","https://openalex.org/W2142036596","https://openalex.org/W2077600819","https://openalex.org/W2072657027","https://openalex.org/W2061531152","https://openalex.org/W2051487156","https://openalex.org/W2007980826","https://openalex.org/W1979597421"],"abstract_inverted_index":{"We":[0,186,268],"present":[1],"an":[2,200],"algorithm":[3],"for":[4,287],"non-holonomic":[5,29,52],"motion":[6],"planning":[7],"(or":[8],"'parking":[9],"a":[10,18,39,71,99,111,162,191,215,247,250,256,280,288],"car')":[11],"that":[12,133,164,203,277],"is":[13,38,46,56,211,231,279],"as":[14,17,58,60,212,214],"computationally":[15],"efficient":[16,213,285],"simple":[19,216],"approach":[20,37],"to":[21,90,167,189,218],"solving":[22],"the":[23,28,36,42,51,61,67,81,105,159,179,219,236,240],"famous":[24],"Piano-mover's":[25,68],"problem,":[26],"where":[27],"constraints":[30],"are":[31,130],"ignored.":[32],"The":[33,44,126,142,173],"core":[34],"of":[35,41,66,74,101,113,239],"graph-discretization":[40,45],"problem.":[43],"provably":[47],"accurate":[48],"in":[49,199,224],"modeling":[50],"constraints,":[53],"and":[54,88,115,139,175,210,242,265,272,275,284],"yet":[55],"nearly":[57],"small":[59],"straightforward":[62],"regular":[63],"grid":[64,260],"discretization":[65],"problem":[69,222],"into":[70,182],"3D":[72],"volume":[73],"2D":[75],"position":[76],"plus":[77],"angular":[78,124,266],"orientation.":[79],"Where":[80],"Piano":[82,220],"mover's":[83,221],"graph":[84,106,143,156,160,194],"has":[85,161],"one":[86],"vertex":[87],"edges":[89],"six":[91],"neighbors":[92],"each,":[93],"we":[94],"have":[95],"three":[96],"vertices":[97],"with":[98,147,169,261],"total":[100],"ten":[102],"edges,":[103],"increasing":[104],"size":[107],"by":[108],"less":[109],"than":[110,235],"factor":[112,117],"two,":[114],"this":[116,188],"does":[118],"not":[119],"depend":[120],"on":[121,249],"spatial":[122,264],"or":[123,153,207],"resolution.":[125,267],"local":[127],"edge":[128],"connections":[129],"organized":[131],"so":[132],"they":[134],"represent":[135],"globally":[136],"consistent":[137],"turn":[138,174],"straight":[140,176],"segments.":[141],"can":[144,243],"be":[145],"used":[146],"Dijkstra's":[148],"algorithm,":[149],"A*,":[150],"value":[151],"iteration":[152],"any":[154],"other":[155],"algorithm.":[157],"Furthermore,":[158],"structure":[163],"lends":[165],"itself":[166],"processing":[168,195,238],"deterministic":[170],"massive":[171],"parallelism.":[172],"curves":[177],"divide":[178],"configuration":[180,257],"space":[181,258],"many":[183,232,245],"parallel":[184,228],"groups.":[185],"use":[187],"develop":[190],"customized":[192],"'kernel-style'":[193],"method.":[196],"It":[197],"results":[198],"N-turn":[201],"planner":[202],"requires":[204],"no":[205],"heuristics":[206],"load":[208],"balancing":[209],"solution":[217],"even":[223],"sequential":[225,237],"form.":[226],"In":[227],"form":[229],"it":[230,278],"times":[233,246],"faster":[234],"graph,":[241],"run":[244],"second":[248],"consumer":[251],"grade":[252],"GPU":[253],"while":[254],"exploring":[255],"pose":[259],"very":[262],"high":[263],"prove":[269],"approximation":[270],"quality":[271],"computational":[273],"complexity":[274],"demonstrate":[276],"flexible,":[281],"practical,":[282],"reliable,":[283],"component":[286],"production":[289],"solution.":[290]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4379473837","counts_by_year":[],"updated_date":"2025-01-04T16:31:25.234994","created_date":"2023-06-07"}