{"id":"https://openalex.org/W1983758950","doi":"https://doi.org/10.1109/icra.2013.6631294","title":"A receding horizon algorithm for informative path planning with temporal logic constraints","display_name":"A receding horizon algorithm for informative path planning with temporal logic constraints","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W1983758950","doi":"https://doi.org/10.1109/icra.2013.6631294","mag":"1983758950"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2013.6631294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/A5103266699","display_name":"Austin Jones","orcid":"https://orcid.org/0000-0003-0680-1477"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Austin Jones","raw_affiliation_strings":["Div. of Syst. Eng., Boston Univ., Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Div. of Syst. Eng., Boston Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081950488","display_name":"Mac Schwager","orcid":"https://orcid.org/0000-0002-7871-3663"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mac Schwager","raw_affiliation_strings":["Div. of Syst. Eng., Boston Univ., Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Div. of Syst. Eng., Boston Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Calin Belta","raw_affiliation_strings":["Div. of Syst. Eng., Boston Univ., Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Div. of Syst. Eng., Boston Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103266699"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":1.9356,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87516853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"34","issue":null,"first_page":"5019","last_page":"5024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9959999918937683,"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":0.9959999918937683,"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.993399977684021,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9876000285148621,"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/path","display_name":"Path (computing)","score":0.7062068581581116},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6893942356109619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6202171444892883},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5897811651229858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5709402561187744},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.5643566250801086},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5373498201370239},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.48886340856552124},{"id":"https://openalex.org/keywords/horizon","display_name":"Horizon","score":0.4750121533870697},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4724873900413513},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4181824028491974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41654330492019653},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38355380296707153},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3079623579978943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24202311038970947}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7062068581581116},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6893942356109619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6202171444892883},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5897811651229858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5709402561187744},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.5643566250801086},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5373498201370239},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.48886340856552124},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.4750121533870697},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4724873900413513},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4181824028491974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41654330492019653},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38355380296707153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3079623579978943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24202311038970947},{"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/C111368507","wikidata":"https://www.wikidata.org/wiki/Q43518","display_name":"Oceanography","level":1,"score":0.0},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2013.6631294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.3653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.3653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sites.bu.edu/msl/files/2013/12/JonesSchwagerBeltaICRA13scLTLInfo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W125598877","https://openalex.org/W301805053","https://openalex.org/W1490092700","https://openalex.org/W1540883472","https://openalex.org/W1555599194","https://openalex.org/W1872123694","https://openalex.org/W1978956894","https://openalex.org/W1995875735","https://openalex.org/W2000559735","https://openalex.org/W2054826948","https://openalex.org/W2066291790","https://openalex.org/W2099111195","https://openalex.org/W2100430744","https://openalex.org/W2110915954","https://openalex.org/W2125069195","https://openalex.org/W2125943099","https://openalex.org/W2130290065","https://openalex.org/W2132022337","https://openalex.org/W2134673975","https://openalex.org/W2135639338","https://openalex.org/W2148134592","https://openalex.org/W2148446974","https://openalex.org/W2167372206","https://openalex.org/W2172103629","https://openalex.org/W2478708596","https://openalex.org/W2516604945","https://openalex.org/W3099664902","https://openalex.org/W4237168462","https://openalex.org/W6610558371","https://openalex.org/W6679093593","https://openalex.org/W6679159306","https://openalex.org/W6679191575","https://openalex.org/W6681820689","https://openalex.org/W6726232123"],"related_works":["https://openalex.org/W2906267174","https://openalex.org/W134501823","https://openalex.org/W2615656344","https://openalex.org/W2013239059","https://openalex.org/W2295626654","https://openalex.org/W4286622840","https://openalex.org/W2536121351","https://openalex.org/W2809608782","https://openalex.org/W2333245620","https://openalex.org/W1889576908"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"This":[2],"paper":[3],"considers":[4],"the":[5,9,61],"problem":[6],"of":[7,24],"finding":[8],"most":[10],"informative":[11,37],"path":[12,38,58],"for":[13,36],"a":[14,21,57,69,77,98],"sensing":[15],"robot":[16],"under":[17],"temporal":[18,63],"logic":[19,64],"constraints,":[20],"richer":[22],"set":[23],"constraints":[25],"than":[26,97],"have":[27],"previously":[28],"been":[29],"considered":[30],"in":[31,73],"information":[32,46],"gathering.":[33],"An":[34],"algorithm":[35,67,94],"planning":[39],"is":[40,53],"presented":[41],"that":[42,59,92],"leverages":[43],"tools":[44],"from":[45,87],"theory":[47],"and":[48,52],"formal":[49],"control":[50],"synthesis,":[51],"proven":[54],"to":[55,75],"give":[56],"satisfies":[60],"given":[62],"constraints.":[65],"The":[66],"uses":[68],"receding":[70],"horizon":[71],"approach":[72],"order":[74],"provide":[76],"reactive,":[78],"on-line":[79],"solution":[80],"while":[81],"mitigating":[82],"computational":[83],"complexity.":[84],"Statistics":[85],"compiled":[86],"multiple":[88],"simulation":[89],"studies":[90],"indicate":[91],"this":[93],"performs":[95],"better":[96],"baseline":[99],"exhaustive":[100],"search":[101],"approach.":[102],"I.":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}