{"id":"https://openalex.org/W2113222527","doi":"https://doi.org/10.1109/cdc.2003.1272513","title":"Continuous path planning with multiple constraints","display_name":"Continuous path planning with multiple constraints","publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W2113222527","doi":"https://doi.org/10.1109/cdc.2003.1272513","mag":"2113222527"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2003.1272513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-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/A5086488324","display_name":"Ian M. Mitchell","orcid":"https://orcid.org/0000-0001-7053-441X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I.M. Mitchell","raw_affiliation_strings":["Department of Electrical Engineering & Computer Science, University of California, Berkeley, USA","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering & Computer Science, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077833674","display_name":"Shivakumar Sastry","orcid":"https://orcid.org/0000-0002-9236-851X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sastry","raw_affiliation_strings":["Department of Electrical Engineering & Computer Science, University of California, Berkeley, USA","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering & Computer Science, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086488324"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":3.8622,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.94073544,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5502","last_page":"5507"},"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/T12158","display_name":"Guidance and Control Systems","score":0.9775000214576721,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9735000133514404,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/maxima-and-minima","display_name":"Maxima and minima","score":0.7232779860496521},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7186117172241211},{"id":"https://openalex.org/keywords/eikonal-equation","display_name":"Eikonal equation","score":0.560630202293396},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5493504405021667},{"id":"https://openalex.org/keywords/partial-differential-equation","display_name":"Partial differential equation","score":0.5297245383262634},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5258898138999939},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5214680433273315},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5060428977012634},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.479882150888443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47403931617736816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4542362093925476},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.4434373080730438},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4403303563594818},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.43354368209838867},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3477741777896881},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2950301468372345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08114999532699585},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07951036095619202}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7232779860496521},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7186117172241211},{"id":"https://openalex.org/C40375134","wikidata":"https://www.wikidata.org/wiki/Q1303846","display_name":"Eikonal equation","level":2,"score":0.560630202293396},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5493504405021667},{"id":"https://openalex.org/C93779851","wikidata":"https://www.wikidata.org/wiki/Q271977","display_name":"Partial differential equation","level":2,"score":0.5297245383262634},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5258898138999939},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5214680433273315},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5060428977012634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.479882150888443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47403931617736816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4542362093925476},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.4434373080730438},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4403303563594818},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.43354368209838867},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3477741777896881},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2950301468372345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08114999532699585},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07951036095619202},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2003.1272513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.568","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://www.cs.ubc.ca/~mitchell/Papers/cdcMCPP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.133.6748","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/~mitchell/Papers/publishedCDC03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6899999976158142,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1487586009","https://openalex.org/W1535896976","https://openalex.org/W1999244633","https://openalex.org/W1999690352","https://openalex.org/W2003009438","https://openalex.org/W2053407718","https://openalex.org/W2055341194","https://openalex.org/W2056528953","https://openalex.org/W2057462050","https://openalex.org/W2067203482","https://openalex.org/W2101234060","https://openalex.org/W2103120971","https://openalex.org/W2113222527","https://openalex.org/W2130202407","https://openalex.org/W2146079123","https://openalex.org/W2169528473","https://openalex.org/W2561843528","https://openalex.org/W2752885492","https://openalex.org/W2998023265","https://openalex.org/W3171712720","https://openalex.org/W4241127195","https://openalex.org/W4242811155","https://openalex.org/W6675250796","https://openalex.org/W6681386857","https://openalex.org/W6993258220"],"related_works":["https://openalex.org/W2466106906","https://openalex.org/W2069187387","https://openalex.org/W2115886818","https://openalex.org/W2024879731","https://openalex.org/W2044847021","https://openalex.org/W4312942633","https://openalex.org/W1970131234","https://openalex.org/W1963990918","https://openalex.org/W1526607502","https://openalex.org/W2372778757"],"abstract_inverted_index":{"We":[0,108],"examine":[1],"the":[2,25,35,51,54,104,120,139,146,149],"problem":[3],"of":[4,53,148,155],"planning":[5],"a":[6,9,41],"path":[7],"through":[8],"low":[10],"dimensional":[11],"continuous":[12],"state":[13,150],"space":[14,151],"subject":[15],"to":[16,65,103],"upper":[17],"bounds":[18],"on":[19,40,119],"several":[20],"additive":[21,84],"cost":[22,27,85,156],"metrics.":[23],"For":[24],"single":[26],"case,":[28],"previously":[29],"published":[30],"research":[31],"has":[32],"proposed":[33],"constructing":[34],"paths":[36,88,115,135],"by":[37,92],"gradient":[38],"descent":[39],"local":[42],"minima":[43],"free":[44],"value":[45,48,93,105],"function.":[46],"This":[47],"function":[49,106],"is":[50,143,158],"solution":[52],"Eikonal":[55],"partial":[56,75],"differential":[57,76],"equation,":[58],"and":[59,129,153],"efficient":[60],"algorithms":[61],"have":[62],"been":[63],"designed":[64],"compute":[66],"it.":[67],"In":[68],"this":[69,96],"paper":[70],"we":[71,80,130],"propose":[72,110],"an":[73,111],"auxiliary":[74,97],"equation":[77,98],"with":[78],"which":[79,89,113,137],"can":[81,131],"evaluate":[82],"multiple":[83],"metrics":[86,157],"for":[87,124],"are":[90],"generated":[91],"functions;":[94],"solving":[95],"adds":[99],"little":[100],"more":[101],"work":[102],"computation.":[107],"then":[109],"algorithm":[112],"generates":[114],"whose":[116],"costs":[117],"lie":[118],"Pareto":[121],"optimal":[122],"surface":[123],"each":[125],"possible":[126],"destination":[127],"location,":[128],"choose":[132],"from":[133],"these":[134],"those":[136],"satisfy":[138],"constraints.":[140],"The":[141],"procedure":[142],"practical":[144],"when":[145],"sum":[147],"dimension":[152],"number":[154],"roughly":[159],"six":[160],"or":[161],"below.":[162]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}