{"id":"https://openalex.org/W1998269577","doi":"https://doi.org/10.1109/icra.2012.6225182","title":"Egress: An online path planning algorithm for boundary exploration","display_name":"Egress: An online path planning algorithm for boundary exploration","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1998269577","doi":"https://doi.org/10.1109/icra.2012.6225182","mag":"1998269577"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2012.6225182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6225182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","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/A5029731923","display_name":"K. R. Guruprasad","orcid":"https://orcid.org/0000-0002-9654-519X"},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]},{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"K.R. Guruprasad","raw_affiliation_strings":["Department of Computer Science, University of Nebraska, Omaha, NE, USA","Department of Mechanical Engineering, National Institute of Technology Karnataka, Mangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Department of Mechanical Engineering, National Institute of Technology Karnataka, Mangalore, India","institution_ids":["https://openalex.org/I11880225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064559085","display_name":"Prithviraj Dasgupta","orcid":"https://orcid.org/0000-0003-4601-905X"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prithviraj Dasgupta","raw_affiliation_strings":["Department of Computer Science, University of Nebraska, Omaha, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029731923"],"corresponding_institution_ids":["https://openalex.org/I11880225","https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.5491,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6663086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"37","issue":null,"first_page":"3991","last_page":"3996"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.7611068487167358},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7120069265365601},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.7027135491371155},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6627849340438843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6448886394500732},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5824140310287476},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5335960984230042},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5068402886390686},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49219122529029846},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44565653800964355},{"id":"https://openalex.org/keywords/point-location","display_name":"Point location","score":0.42048829793930054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40520185232162476},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29368749260902405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1929815411567688},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07765260338783264}],"concepts":[{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.7611068487167358},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7120069265365601},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.7027135491371155},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6627849340438843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6448886394500732},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5824140310287476},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5335960984230042},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5068402886390686},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49219122529029846},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44565653800964355},{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.42048829793930054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40520185232162476},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29368749260902405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1929815411567688},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07765260338783264},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/icra.2012.6225182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6225182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W167683769","https://openalex.org/W1521785144","https://openalex.org/W1544032329","https://openalex.org/W1963926535","https://openalex.org/W1998813085","https://openalex.org/W2105848344","https://openalex.org/W2119559506","https://openalex.org/W2129977790","https://openalex.org/W2155183030","https://openalex.org/W2158334497","https://openalex.org/W6606890364"],"related_works":["https://openalex.org/W1850281117","https://openalex.org/W1904098742","https://openalex.org/W2155632758","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W2618632915","https://openalex.org/W2077416514","https://openalex.org/W4292862729","https://openalex.org/W2150982344"],"abstract_inverted_index":{"We":[0,63,84],"consider":[1],"the":[2,24,31,35,38,48,61,82,92,100,104],"problem":[3,73],"of":[4,37,52,103],"navigating":[5],"a":[6,17,21,58,107],"mobile":[7],"robot":[8,32,93],"that":[9,74,87],"is":[10,94],"located":[11],"at":[12],"any":[13],"arbitrary":[14],"point":[15,22],"within":[16,106],"bounded":[18],"environment,":[19],"to":[20,33,60,70,96],"on":[23,81],"environment's":[25],"outer":[26,101],"boundary":[27,102],"and":[28,47,50,79,98],"then,":[29],"using":[30,89],"explore":[34,99],"perimeter":[36],"boundary.":[39],"The":[40],"environment":[41,105],"can":[42],"have":[43],"obstacles":[44,54],"in":[45],"it":[46],"location":[49],"size":[51],"these":[53],"are":[55],"not":[56],"provided":[57],"priori":[59],"robot.":[62,83],"present":[64],"an":[65],"online":[66],"path":[67],"planning":[68],"algorithm":[69],"solve":[71],"this":[72],"requires":[75],"very":[76],"simple":[77],"behaviors":[78],"computation":[80],"analytically":[85],"prove":[86],"by":[88],"our":[90],"algorithm,":[91],"guaranteed":[95],"reach":[97],"finite":[108],"time.":[109]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}