{"id":"https://openalex.org/W2568555787","doi":"https://doi.org/10.1109/cdc.2016.7799176","title":"Efficient graph-based informative path planning using cross entropy","display_name":"Efficient graph-based informative path planning using cross entropy","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2568555787","doi":"https://doi.org/10.1109/cdc.2016.7799176","mag":"2568555787"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2016.7799176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7799176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th Conference on Decision and Control (CDC)","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/A5101682061","display_name":"Junghun Suh","orcid":"https://orcid.org/0000-0001-9051-8097"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Junghun Suh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034975936","display_name":"Kyunghoon Cho","orcid":"https://orcid.org/0000-0002-4679-6660"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyunghoon Cho","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033764106","display_name":"Songhwai Oh","orcid":"https://orcid.org/0000-0002-9781-2018"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Songhwai Oh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101682061"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15204659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"5894","last_page":"5899"},"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.9972000122070312,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/scalability","display_name":"Scalability","score":0.7076340317726135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6309130191802979},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6155025362968445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5482171773910522},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5192146897315979},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4946419894695282},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47856405377388},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.47541528940200806},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.45496541261672974},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.422936350107193},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.41133415699005127},{"id":"https://openalex.org/keywords/cross-entropy","display_name":"Cross entropy","score":0.4108666181564331},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3878583312034607},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.35754409432411194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32241079211235046},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27200889587402344},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.252153605222702},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.24872303009033203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21790418028831482}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7076340317726135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309130191802979},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6155025362968445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5482171773910522},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5192146897315979},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4946419894695282},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47856405377388},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.47541528940200806},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.45496541261672974},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.422936350107193},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.41133415699005127},{"id":"https://openalex.org/C167981619","wikidata":"https://www.wikidata.org/wiki/Q1685498","display_name":"Cross entropy","level":3,"score":0.4108666181564331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3878583312034607},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35754409432411194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32241079211235046},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27200889587402344},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.252153605222702},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.24872303009033203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21790418028831482},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2016.7799176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7799176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1495074106","https://openalex.org/W1658011328","https://openalex.org/W1888754704","https://openalex.org/W1971086298","https://openalex.org/W1985658808","https://openalex.org/W1999824796","https://openalex.org/W2000359213","https://openalex.org/W2018020586","https://openalex.org/W2021774297","https://openalex.org/W2025800439","https://openalex.org/W2045173716","https://openalex.org/W2083327122","https://openalex.org/W2098642746","https://openalex.org/W2103052138","https://openalex.org/W2109209963","https://openalex.org/W2115384379","https://openalex.org/W2143088799","https://openalex.org/W2148134592","https://openalex.org/W2166295994","https://openalex.org/W2405526757","https://openalex.org/W2516604945","https://openalex.org/W2962707519","https://openalex.org/W3099242408","https://openalex.org/W3146269391","https://openalex.org/W4211049957","https://openalex.org/W6629802819","https://openalex.org/W6631084031","https://openalex.org/W6639585552","https://openalex.org/W6676811314","https://openalex.org/W6726232123","https://openalex.org/W6792982978"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2080931671","https://openalex.org/W2389896347","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2106119116"],"abstract_inverted_index":{"In":[0,129],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,28,64,111],"novel":[6],"informative":[7,98,138],"path":[8,26,99,139],"planning":[9,33],"algorithm":[10,59,85,109,120],"using":[11,31,60],"an":[12,55,61],"active":[13],"sensor":[14],"for":[15],"efficient":[16,56],"environmental":[17],"monitoring.":[18],"While":[19],"the":[20,24,73,81,87,91,96,101,107,118,123,126,131],"state-of-the-art":[21,119],"algorithms":[22],"find":[23],"optimal":[25,113],"in":[27],"continuous":[29],"space":[30],"sampling-based":[32],"method,":[34,67],"such":[35,47],"as":[36,48],"rapidly-exploring":[37],"random":[38],"graphs":[39],"(RRG),":[40],"there":[41],"are":[42],"still":[43],"some":[44],"key":[45],"limitations,":[46],"computational":[49],"complexity":[50],"and":[51,63,94,121],"scalability.":[52],"We":[53,104],"propose":[54],"information":[57,75],"gathering":[58],"RRG":[62,92],"stochastic":[65],"optimization":[66],"cross":[68],"entropy":[69],"(CE),":[70],"to":[71,117,136],"estimate":[72],"reachable":[74],"gain":[76],"at":[77],"each":[78],"node":[79],"of":[80,90,125],"graph.":[82],"The":[83],"proposed":[84,108,127,132],"maintains":[86],"asymptotic":[88],"optimality":[89],"planner":[93],"finds":[95,110],"most":[97],"satisfying":[100],"cost":[102],"constraint.":[103],"demonstrate":[105],"that":[106],"(near)":[112],"solution":[114],"efficiently":[115],"compared":[116],"show":[122],"scalability":[124],"method.":[128],"addition,":[130],"method":[133],"is":[134],"applied":[135],"multi-robot":[137],"planning.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}