{"id":"https://openalex.org/W1996489232","doi":"https://doi.org/10.1137/s0097539798331975","title":"Nonuniform Discretization for Kinodynamic Motion Planning and its Applications","display_name":"Nonuniform Discretization for Kinodynamic Motion Planning and its Applications","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1996489232","doi":"https://doi.org/10.1137/s0097539798331975","mag":"1996489232"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798331975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798331975","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"John H. Reif","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100359664","display_name":"Hongyan Wang","orcid":"https://orcid.org/0000-0002-3944-4501"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hongyan Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007364145"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8001,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.75778392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"1","first_page":"161","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9678999781608582,"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/discretization","display_name":"Discretization","score":0.8815855979919434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7271760702133179},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5989989042282104},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44660574197769165},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.43768125772476196},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41226115822792053},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.3844870924949646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3604575991630554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32379695773124695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2000299096107483},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.18968740105628967},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07746490836143494},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07016104459762573}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.8815855979919434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7271760702133179},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5989989042282104},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44660574197769165},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.43768125772476196},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41226115822792053},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3844870924949646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3604575991630554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32379695773124695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2000299096107483},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.18968740105628967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07746490836143494},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07016104459762573},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539798331975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798331975","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.9940","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~reif/paper/hongyan/kino/kino.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W150708112","https://openalex.org/W1494464587","https://openalex.org/W1553616171","https://openalex.org/W1654807447","https://openalex.org/W1839719523","https://openalex.org/W1906607213","https://openalex.org/W1915080814","https://openalex.org/W1965167217","https://openalex.org/W1968984213","https://openalex.org/W1971998222","https://openalex.org/W1973594680","https://openalex.org/W1986329093","https://openalex.org/W1988819636","https://openalex.org/W1997373994","https://openalex.org/W2007143945","https://openalex.org/W2022921915","https://openalex.org/W2024479433","https://openalex.org/W2048820947","https://openalex.org/W2059435624","https://openalex.org/W2067754486","https://openalex.org/W2090544108","https://openalex.org/W2102203318","https://openalex.org/W2111734814","https://openalex.org/W2117086819","https://openalex.org/W2131339983","https://openalex.org/W2133358493","https://openalex.org/W2142578141","https://openalex.org/W2146467128","https://openalex.org/W2148970883","https://openalex.org/W2156708479","https://openalex.org/W2163042598","https://openalex.org/W2166034910","https://openalex.org/W2167045953","https://openalex.org/W2170220350","https://openalex.org/W2170508483","https://openalex.org/W2270974788","https://openalex.org/W2313274380","https://openalex.org/W2404694939","https://openalex.org/W2985576870","https://openalex.org/W3014033153"],"related_works":["https://openalex.org/W2006251942","https://openalex.org/W2364741597","https://openalex.org/W1492103595","https://openalex.org/W1864774435","https://openalex.org/W946352265","https://openalex.org/W3020787026","https://openalex.org/W2334479858","https://openalex.org/W2799209613","https://openalex.org/W1971388572","https://openalex.org/W1507702947"],"abstract_inverted_index":{"The":[0,19],"first":[1,200],"main":[2,196],"result":[3,197],"of":[4,81,88,94,115,122,124,136,188],"this":[5,217,232],"paper":[6],"is":[7,23,118,131,141,152,162,191,198],"a":[8,26,31,46,59,68,103,106,120],"novel":[9],"nonuniform":[10,60,69,155],"discretization":[11,48,61,156,190],"approximation":[12,40,203,222],"method":[13,57],"for":[14,30,173,205,224],"the":[15,50,54,63,72,77,85,112,116,125,137,148,158,176,181,186,189,199,206,221,225],"kinodynamic":[16,20,226],"motion-planning":[17,21,227],"problem.":[18,233],"problem":[22,209,228],"to":[24,76,99,133,143,231],"compute":[25],"collision-free,":[27],"time-optimal":[28],"trajectory":[29,104,117],"robot":[32],"whose":[33],"accelerations":[34],"and":[35,83,140,212],"velocities":[36],"are":[37,42,167,178,183,229],"bounded.":[38],"Previous":[39],"methods":[41],"all":[43,170],"based":[44],"on":[45],"uniform":[47],"in":[49,62,71,92,101,105,164,210],"time":[51,73,87,113],"space.":[52],"On":[53],"contrary,":[55],"our":[56,89,129,154],"employs":[58],"configuration":[64,108],"space":[65],"(thus":[66],"also":[67],"one":[70],"space).":[74],"Compared":[75],"previously":[78],"best":[79],"algorithm":[80,90,130,204],"Donald":[82],"Xavier,":[84],"running":[86],"reduces":[91],"terms":[93],"$1/\\varepsilon$,":[95],"roughly":[96],"from":[97,169],"$O((1/\\varepsilon)^{6d-1})$":[98],"$O((1/\\varepsilon)^{4d-2})$,":[100],"computing":[102],"d-dimensional":[107],"space,":[109],"such":[110],"that":[111,160,166,220],"length":[114],"within":[119],"factor":[121],"$(1+\\varepsilon)$":[123],"optimal.":[126],"More":[127],"importantly,":[128],"able":[132],"take":[134],"advantage":[135],"obstacle":[138],"distribution":[139],"expected":[142],"perform":[144],"much":[145],"better":[146],"than":[147],"analytical":[149],"result.":[150],"This":[151],"because":[153],"has":[157],"property":[159],"it":[161],"coarser":[163],"regions":[165],"farther":[168],"obstacles.":[171],"So":[172],"situations":[174],"where":[175],"obstacles":[177,182],"sparse,":[179],"or":[180],"unevenly":[184],"distributed,":[185],"size":[187],"significantly":[192],"smaller.":[193],"Our":[194],"second":[195],"known":[201],"polynomial-time":[202],"curvature-constrained":[207],"shortest-path":[208],"three":[211],"higher":[213],"dimensions.":[214],"We":[215],"achieved":[216],"by":[218],"showing":[219],"techniques":[223],"applicable":[230]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}