{"id":"https://openalex.org/W4402437030","doi":"https://doi.org/10.1109/ccta60707.2024.10666559","title":"A Heuristic Informative-Path-Planning Algorithm to Map Unknown Areas and A Benchmark Solution","display_name":"A Heuristic Informative-Path-Planning Algorithm to Map Unknown Areas and A Benchmark Solution","publication_year":2024,"publication_date":"2024-08-21","ids":{"openalex":"https://openalex.org/W4402437030","doi":"https://doi.org/10.1109/ccta60707.2024.10666559"},"language":"en","primary_location":{"id":"doi:10.1109/ccta60707.2024.10666559","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ccta60707.2024.10666559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://gala.gre.ac.uk/id/eprint/47471/7/47471_ORISATOKI_A_heuristic_informative-path-planning_algorithm_to_map_unknown_areas_and_a_benchmark_solution.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083243132","display_name":"Mobolaji Olawumi Orisatoki","orcid":null},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mobolaji O. Orisatoki","raw_affiliation_strings":["University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK","institution_ids":["https://openalex.org/I162608824"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071995639","display_name":"Mahdi Amouzadi","orcid":"https://orcid.org/0000-0001-8933-5701"},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mahdi Amouzadi","raw_affiliation_strings":["University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK","institution_ids":["https://openalex.org/I162608824"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089704985","display_name":"Arash M. Dizqah","orcid":"https://orcid.org/0000-0003-3377-6107"},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Arash M. Dizqah","raw_affiliation_strings":["University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sussex,Smart Vehicle Control Laboratory (SVeCLab), School of Engineering and Informatics,Brighton,UK","institution_ids":["https://openalex.org/I162608824"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I162608824"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"254","last_page":"261"},"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.9958999752998352,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9768999814987183,"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/benchmark","display_name":"Benchmark (surveying)","score":0.8208843469619751},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7373569011688232},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6622589230537415},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6328606605529785},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6195477247238159},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47714942693710327},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4117692708969116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3581975996494293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17401650547981262},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10111048817634583},{"id":"https://openalex.org/keywords/cartography","display_name":"Cartography","score":0.08807820081710815},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.06410202383995056}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8208843469619751},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7373569011688232},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6622589230537415},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6328606605529785},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6195477247238159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47714942693710327},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4117692708969116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3581975996494293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17401650547981262},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10111048817634583},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.08807820081710815},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.06410202383995056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ccta60707.2024.10666559","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ccta60707.2024.10666559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"},{"id":"pmh:oai:gala.gre.ac.uk:47471","is_oa":true,"landing_page_url":"https://doi.org/10.1109/CCTA60707.2024.10666559>)","pdf_url":"http://gala.gre.ac.uk/id/eprint/47471/7/47471_ORISATOKI_A_heuristic_informative-path-planning_algorithm_to_map_unknown_areas_and_a_benchmark_solution.pdf","source":{"id":"https://openalex.org/S4306401244","display_name":"Greenwich Academic Literature Archive (University of Greenwich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55060895","host_organization_name":"University of Greenwich","host_organization_lineage":["https://openalex.org/I55060895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},{"id":"pmh:oai:figshare.com:article/29919824","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_heuristic_informative-path-planning_algorithm_to_map_unknown_areas_and_a_benchmark_solution/29919824","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"}],"best_oa_location":{"id":"pmh:oai:gala.gre.ac.uk:47471","is_oa":true,"landing_page_url":"https://doi.org/10.1109/CCTA60707.2024.10666559>)","pdf_url":"http://gala.gre.ac.uk/id/eprint/47471/7/47471_ORISATOKI_A_heuristic_informative-path-planning_algorithm_to_map_unknown_areas_and_a_benchmark_solution.pdf","source":{"id":"https://openalex.org/S4306401244","display_name":"Greenwich Academic Literature Archive (University of Greenwich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55060895","host_organization_name":"University of Greenwich","host_organization_lineage":["https://openalex.org/I55060895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4402437030.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1573725801","https://openalex.org/W1971086298","https://openalex.org/W1975994434","https://openalex.org/W1979937625","https://openalex.org/W2019738489","https://openalex.org/W2056554710","https://openalex.org/W2076518796","https://openalex.org/W2092280157","https://openalex.org/W2097233018","https://openalex.org/W2110824994","https://openalex.org/W2134212165","https://openalex.org/W2169680472","https://openalex.org/W2796419292","https://openalex.org/W2912372166","https://openalex.org/W2942307437","https://openalex.org/W2947525982","https://openalex.org/W2951725413","https://openalex.org/W2962826218","https://openalex.org/W2973864946","https://openalex.org/W2981460880","https://openalex.org/W3004751533","https://openalex.org/W3084487819","https://openalex.org/W3100948105","https://openalex.org/W3205360279","https://openalex.org/W4210376712"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"Informative":[0],"path":[1,34,181],"planning":[2],"algorithms":[3],"are":[4],"of":[5,40,120,135,142,148,156],"paramount":[6],"importance":[7],"in":[8,140,160],"applications":[9],"like":[10],"disaster":[11],"management":[12],"to":[13,89,101,113,116,154,171,177],"efficiently":[14],"gather":[15],"information":[16,41],"through":[17],"a":[18,25,31,47,65,98,103,110],"priori":[19,111],"unknown":[20],"environments.":[21],"This":[22,58],"is,":[23],"however,":[24],"complex":[26],"problem":[27,62],"that":[28,35,69,132,174],"involves":[29],"finding":[30],"globally":[32,179],"optimal":[33,180],"gathers":[36],"the":[37,43,72,80,92,107,114,118,121,133,136,143,157,166,169,178,184],"maximum":[38],"amount":[39],"(e.g.,":[42],"largest":[44],"map":[45,108],"with":[46],"minimum":[48],"travelling":[49,149],"distance)":[50],"while":[51],"using":[52],"partial":[53],"and":[54,84],"uncertain":[55],"local":[56],"measurements.":[57],"paper":[59,96],"addresses":[60],"this":[61,95],"by":[63,183],"proposing":[64],"novel":[66,99],"heuristic":[67,123],"algorithm":[68,100,124,167],"continuously":[70],"estimates":[71],"potential":[73],"mapping":[74],"gain":[75],"for":[76],"different":[77,126],"sub-areas":[78],"across":[79],"partially":[81],"created":[82],"map,":[83],"then":[85],"uses":[86],"these":[87],"estimations":[88],"locally":[90],"navigate":[91],"robot.":[93],"Furthermore,":[94],"presents":[97],"calculate":[102],"benchmark":[104,158,185],"solution,":[105],"where":[106],"is":[109],"known":[112],"planar,":[115],"evaluate":[117],"efficacy":[119],"developed":[122],"over":[125],"test":[127,162],"scenarios.":[128,163],"The":[129],"findings":[130],"indicate":[131],"efficiency":[134],"proposed":[137],"algorithm,":[138],"measured":[139],"terms":[141],"mapped":[144],"area":[145],"per":[146],"unit":[147],"distance,":[150],"ranges":[151],"from":[152],"70%":[153],"80%":[155],"solution":[159],"various":[161],"In":[164],"essence,":[165],"demonstrates":[168],"capability":[170],"generate":[172],"paths":[173],"come":[175],"close":[176],"provided":[182],"solution.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}