{"id":"https://openalex.org/W2137252289","doi":"https://doi.org/10.1109/cdc.2008.4739394","title":"Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm","display_name":"Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2137252289","doi":"https://doi.org/10.1109/cdc.2008.4739394","mag":"2137252289"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2008.4739394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","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/A5077010548","display_name":"Michael P. Vitus","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael P. Vitus","raw_affiliation_strings":["Aeronautics and Astronautics, University of Stanford, Stanford, CA, USA","Stanford University Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Aeronautics and Astronautics, University of Stanford, Stanford, CA, USA","institution_ids":[]},{"raw_affiliation_string":"Stanford University Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024242059","display_name":"Steven L. Waslander","orcid":"https://orcid.org/0000-0003-4217-4415"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Steven L. Waslander","raw_affiliation_strings":["Department of Mechanical and Mechatronics Engineering, University of Waterloo, Waterloo, ONT, Canada","University of Waterloo Waterloo ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Mechatronics Engineering, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"University of Waterloo Waterloo ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045155646","display_name":"Claire J. Tomlin","orcid":"https://orcid.org/0000-0003-3192-3185"},"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":"Claire J. Tomlin","raw_affiliation_strings":["Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA","University of California, Berkeley, CA/USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley, CA/USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077010548"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.1071,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.88674195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"540","last_page":"545"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9848999977111816,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9843000173568726,"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/decomposition","display_name":"Decomposition","score":0.6379451751708984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6162488460540771},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6148084998130798},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.607576310634613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6056840419769287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5798730254173279},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5753368139266968},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5697616934776306},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5238571166992188},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45211800932884216},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4303865134716034},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4274018704891205},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.42450612783432007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23670226335525513},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1288667917251587},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.12635394930839539},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1027698814868927}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6379451751708984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6162488460540771},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6148084998130798},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.607576310634613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6056840419769287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5798730254173279},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5753368139266968},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5697616934776306},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5238571166992188},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45211800932884216},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4303865134716034},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4274018704891205},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.42450612783432007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23670226335525513},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1288667917251587},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.12635394930839539},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1027698814868927},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2008.4739394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W79131202","https://openalex.org/W1566622904","https://openalex.org/W1986014106","https://openalex.org/W2011039300","https://openalex.org/W2017714866","https://openalex.org/W2061049203","https://openalex.org/W2093834886","https://openalex.org/W2117113000","https://openalex.org/W2121029369","https://openalex.org/W2128990851","https://openalex.org/W2141666765","https://openalex.org/W2296319761","https://openalex.org/W2332600699","https://openalex.org/W4212781311","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W4391249562","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W3043170174","https://openalex.org/W2155948905","https://openalex.org/W4380590094"],"abstract_inverted_index":{"The":[0],"Tunnel-MILP":[1],"algorithm":[2],"is":[3,51,76],"a":[4,19,34,47,93],"three":[5],"stage":[6],"path":[7],"planning":[8],"method":[9,50],"for":[10,53],"2-D":[11],"environments":[12],"that":[13,84,98],"relies":[14],"on":[15,72],"the":[16,44,57,67,70,73,85,99,106,116],"identification":[17],"of":[18,21,43,56,69,115],"sequence":[20],"convex":[22],"polygons":[23],"to":[24,32,82,91],"form":[25],"an":[26],"obstacle":[27],"free":[28],"tunnel":[29,87,100],"through":[30],"which":[31],"plan":[33],"dynamically":[35,108],"feasible":[36,109],"path.":[37],"This":[38,96],"work":[39],"investigates":[40],"two":[41],"aspects":[42],"algorithm.":[45],"First,":[46],"greedy":[48],"cut":[49],"proposed":[52],"improved":[54,90],"decomposition":[55,71],"environment,":[58],"resulting":[59,74,86,107],"in":[60],"fewer":[61],"regions":[62],"than":[63],"existing":[64],"algorithms.":[65],"Second,":[66],"effect":[68],"solution":[75],"investigated,":[77],"and":[78,111],"conditions":[79],"are":[80],"presented":[81],"demonstrate":[83],"cannot":[88],"be":[89],"yield":[92],"better":[94],"solution.":[95,117],"ensures":[97],"provided":[101],"does":[102],"not":[103],"adversely":[104],"affect":[105],"trajectory,":[110],"guarantees":[112],"local":[113],"optimality":[114]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}