{"id":"https://openalex.org/W1510887900","doi":"https://doi.org/10.23919/ecc.2001.7076186","title":"Numerical path optimization for path planning with cell decomposition methods","display_name":"Numerical path optimization for path planning with cell decomposition methods","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W1510887900","doi":"https://doi.org/10.23919/ecc.2001.7076186","mag":"1510887900"},"language":"en","primary_location":{"id":"doi:10.23919/ecc.2001.7076186","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2001.7076186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2001 European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5057760156","display_name":"J. K\u00fcmpel","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Kumpel","raw_affiliation_strings":["Department of Measurement, University of Ulm, Ulm, Germany","University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Measurement, University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061513171","display_name":"Jan Sparbert","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Sparbert","raw_affiliation_strings":["Department of Measurement, University of Ulm, Ulm, Germany","University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Measurement, University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028499905","display_name":"E. Hofer","orcid":"https://orcid.org/0000-0002-6531-9122"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"E.-P. Hofer","raw_affiliation_strings":["Department of Measurement, University of Ulm, Ulm, Germany","University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Measurement, University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"University of Ulm Department of Measurement, Control and Microtechnology D-89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.3882,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53516295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1822","last_page":"1827"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9958000183105469,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9811000227928162,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/motion-planning","display_name":"Motion planning","score":0.7365734577178955},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6442152261734009},{"id":"https://openalex.org/keywords/spline","display_name":"Spline (mechanical)","score":0.6111367344856262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5778599381446838},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5285141468048096},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4942207634449005},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4762839674949646},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.46677106618881226},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.45871761441230774},{"id":"https://openalex.org/keywords/spline-interpolation","display_name":"Spline interpolation","score":0.43760567903518677},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41370058059692383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35979264974594116},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3578142523765564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3445405960083008},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17044755816459656},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.10482761263847351},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08409535884857178}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7365734577178955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6442152261734009},{"id":"https://openalex.org/C10390562","wikidata":"https://www.wikidata.org/wiki/Q581809","display_name":"Spline (mechanical)","level":2,"score":0.6111367344856262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5778599381446838},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5285141468048096},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4942207634449005},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4762839674949646},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.46677106618881226},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.45871761441230774},{"id":"https://openalex.org/C31447003","wikidata":"https://www.wikidata.org/wiki/Q545002","display_name":"Spline interpolation","level":3,"score":0.43760567903518677},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41370058059692383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35979264974594116},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3578142523765564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3445405960083008},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17044755816459656},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.10482761263847351},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08409535884857178},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"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/C205203396","wikidata":"https://www.wikidata.org/wiki/Q612143","display_name":"Bilinear interpolation","level":2,"score":0.0},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc.2001.7076186","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2001.7076186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2001 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"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":4,"referenced_works":["https://openalex.org/W1528196625","https://openalex.org/W2154522324","https://openalex.org/W2169528473","https://openalex.org/W2171074980"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2106119116","https://openalex.org/W2084091668"],"abstract_inverted_index":{"Many":[0],"path":[1,172],"planning":[2,173],"systems":[3],"designed":[4],"for":[5],"the":[6,39,59,62,67,88,95,110,130,144,147,150,154,162],"use":[7],"in":[8,149,166],"autonomous":[9],"mobile":[10],"robots":[11],"are":[12,73,179],"based":[13],"on":[14],"cell":[15,155],"decomposition":[16,41],"methods":[17,36],"combined":[18],"with":[19,129],"a":[20,54,125],"subsequent":[21,126],"graph":[22],"search":[23],"due":[24],"to":[25,52,66,132],"their":[26],"efficiency":[27],"and":[28,105],"ease":[29],"of":[30,61,109,118,146,153,170],"handling.":[31],"Furthermore,":[32,101],"even":[33],"more":[34],"sophisticated":[35],"such":[37,78,119],"as":[38],"quadtree":[40],"method":[42,160,178],"can":[43,93,121],"be":[44,94,113,122],"applied":[45],"prosperously":[46],"Spline":[47],"interpolation":[48],"is":[49,140,164],"often":[50],"used":[51],"attain":[53],"feasible":[55],"trajectory":[56,103],"by":[57,124,142],"interpolating":[58,79],"centerpoints":[60],"cells":[63,152],"which":[64],"belong":[65],"found":[68],"free":[69],"channel.":[70],"Nevertheless,":[71],"there":[72],"some":[74,98],"negative":[75],"effects":[76],"using":[77,161],"spline":[80,111,148],"functions.":[81],"First,":[82],"they":[83],"may":[84,112],"introduce":[85],"oszillations":[86],"between":[87],"control-points.":[89,100],"Second,":[90],"strong":[91,137],"curvatures":[92],"result":[96],"at":[97],"distinguished":[99],"suboptimal":[102],"lengths":[104],"step":[106,128],"function":[107],"behaviour":[108],"present,":[114],"too.":[115],"The":[116],"remedy":[117],"problems":[120],"given":[123],"optimization":[127,159,177],"goal":[131],"obtain":[133],"smooth":[134],"trajectories":[135],"without":[136],"curvatures.":[138],"This":[139],"done":[141],"moving":[143],"control-points":[145],"respective":[151],"decomposition.":[156],"Such":[157],"an":[158],"Nelder-Mead-Algorithm":[163],"presented":[165],"this":[167,176],"paper.":[168],"Examples":[169],"successful":[171],"tasks":[174],"demonstrating":[175],"also":[180],"presented.":[181]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}