{"id":"https://openalex.org/W119793583","doi":null,"title":"A Computationally Tractable Information Foraging Algorithm That Satisfies Time-to-go Constraints","display_name":"A Computationally Tractable Information Foraging Algorithm That Satisfies Time-to-go Constraints","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W119793583","mag":"119793583"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7zx423j4","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7zx423j4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"parent_works":[],"lineage":["https://openalex.org/W119793583"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/uc/item/7zx423j4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037728655","display_name":"Jeremy Gottlieb","orcid":"https://orcid.org/0009-0002-5272-7175","observed_orcids":["https://orcid.org/0009-0002-5272-7175"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeremy Gottlieb","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5037728655"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9829000234603882,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9829000234603882,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.005499999970197678,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/information-foraging","display_name":"information foraging","score":0.9509999752044678},{"id":"https://openalex.org/keywords/robot-path-planning","display_name":"robot path planning","score":0.7009999752044678},{"id":"https://openalex.org/keywords/deadline-constraints","display_name":"deadline constraints","score":0.6579999923706055},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"utility maximization","score":0.6589999794960022},{"id":"https://openalex.org/keywords/d","display_name":"D\u00d8","score":0.46700000762939453},{"id":"https://openalex.org/keywords/exploration-planning","display_name":"exploration planning","score":0.5799999833106995},{"id":"https://openalex.org/keywords/autonomous-underwater-vehicles","display_name":"autonomous underwater vehicles","score":0.7049999833106995},{"id":"https://openalex.org/keywords/planetary-rovers","display_name":"planetary rovers","score":0.6620000004768372},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.5049999952316284},{"id":"https://openalex.org/keywords/approximate-planning","display_name":"approximate planning","score":0.35600000619888306},{"id":"https://openalex.org/keywords/replanning","display_name":"replanning","score":0.5419999957084656}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6122351884841919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6030087471008301},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5936791896820068},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5898120999336243},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5272480845451355},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.47430419921875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45887911319732666},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3970355689525604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3883572518825531},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3825125992298126},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18593722581863403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12510785460472107},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10707783699035645},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:escholarship.org/ark:/13030/qt7zx423j4","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7zx423j4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"pmh:qt7zx423j4","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/7zx423j4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gottlieb, Jeremy. (2014). A Computationally Tractable Information Foraging Algorithm That Satisfies Time-to-go Constraints. UC Santa Cruz: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/7zx423j4","raw_type":"dissertation"},{"id":"mag:119793583","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/content/qt7zx423j4/qt7zx423j4.pdf?t=niu076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7zx423j4","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7zx423j4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W119793583.pdf","grobid_xml":"https://content.openalex.org/works/W119793583.grobid-xml"},"referenced_works_count":88,"referenced_works":["https://openalex.org/W73143588","https://openalex.org/W75213143","https://openalex.org/W106696726","https://openalex.org/W1494390060","https://openalex.org/W1498436455","https://openalex.org/W1508442330","https://openalex.org/W1510898397","https://openalex.org/W1526396946","https://openalex.org/W1536373029","https://openalex.org/W1538593453","https://openalex.org/W1539282749","https://openalex.org/W1582569540","https://openalex.org/W1592052568","https://openalex.org/W1594113195","https://openalex.org/W1608262483","https://openalex.org/W1608422858","https://openalex.org/W1614026214","https://openalex.org/W1777941584","https://openalex.org/W1969061848","https://openalex.org/W1969483458","https://openalex.org/W1972274595","https://openalex.org/W1976096628","https://openalex.org/W1976221040","https://openalex.org/W1978587718","https://openalex.org/W1979876836","https://openalex.org/W1984132513","https://openalex.org/W1985763940","https://openalex.org/W1991622981","https://openalex.org/W1992298963","https://openalex.org/W2002860080","https://openalex.org/W2003708116","https://openalex.org/W2007688248","https://openalex.org/W2017456134","https://openalex.org/W2022740958","https://openalex.org/W2026697786","https://openalex.org/W2027416654","https://openalex.org/W2030597423","https://openalex.org/W2048608180","https://openalex.org/W2050417465","https://openalex.org/W2055207897","https://openalex.org/W2055784052","https://openalex.org/W2062568266","https://openalex.org/W2066145367","https://openalex.org/W2069108894","https://openalex.org/W2072143307","https://openalex.org/W2083044260","https://openalex.org/W2087153461","https://openalex.org/W2087316754","https://openalex.org/W2097617199","https://openalex.org/W2099144379","https://openalex.org/W2106065750","https://openalex.org/W2107878631","https://openalex.org/W2113286054","https://openalex.org/W2114396319","https://openalex.org/W2115478506","https://openalex.org/W2116344475","https://openalex.org/W2118656144","https://openalex.org/W2119241169","https://openalex.org/W2120387504","https://openalex.org/W2123564449","https://openalex.org/W2130338305","https://openalex.org/W2134765105","https://openalex.org/W2135928204","https://openalex.org/W2136891917","https://openalex.org/W2137448073","https://openalex.org/W2137670390","https://openalex.org/W2138332512","https://openalex.org/W2138500663","https://openalex.org/W2142304042","https://openalex.org/W2145089737","https://openalex.org/W2145972539","https://openalex.org/W2146556896","https://openalex.org/W2146747768","https://openalex.org/W2150839555","https://openalex.org/W2154844948","https://openalex.org/W2157887010","https://openalex.org/W2158137377","https://openalex.org/W2159172292","https://openalex.org/W2160401976","https://openalex.org/W2166702347","https://openalex.org/W2169528473","https://openalex.org/W2171875606","https://openalex.org/W2177274602","https://openalex.org/W2286420769","https://openalex.org/W2487232783","https://openalex.org/W2546727747","https://openalex.org/W2611243847","https://openalex.org/W6921966119"],"related_works":["https://openalex.org/W3146429287","https://openalex.org/W2077828922","https://openalex.org/W7100647994","https://openalex.org/W7066740141","https://openalex.org/W7095346579","https://openalex.org/W7095214694","https://openalex.org/W7203598349","https://openalex.org/W2737130609","https://openalex.org/W7099450009","https://openalex.org/W4234155546"],"abstract_inverted_index":{"Robots":[0],"are":[1,9,16,29,35,276],"frequently":[2],"being":[3,111],"used":[4,39],"to":[5,12,40,81,89,113,134,154,185,210,240],"explore":[6],"environments":[7,266],"that":[8,28,47,131,149,188,268,275],"largely":[10],"inaccessible":[11],"humans.":[13],"Most":[14],"people":[15,48],"familiar":[17],"with":[18],"the":[19,54,63,72,87,94,143,151,155,233,248,253,260,269],"ground":[20],"rovers":[21],"such":[22,51,137,200,218],"as":[23,52,138,201,219],"Spirit,":[24],"Opportunity,":[25],"and":[26,91,110,160,216,235,252],"Curiosity":[27],"on":[30,96,102,243],"Mars.":[31],"Autonomous":[32],"underwater":[33],"vehicles":[34],"becoming":[36],"more":[37],"widely":[38],"conduct":[41],"oceanographic":[42],"surveys,":[43],"particularly":[44,77],"in":[45,165,173,232,264],"places":[46],"cannot":[49,162],"go,":[50],"under":[53],"polar":[55],"ice":[56],"caps.":[57],"A":[58],"large":[59],"part":[60],"of":[61,65,86,93,142,169,213,246,250,256,280],"increasing":[62],"utility":[64],"these":[66,224],"robotic":[67,97],"missions":[68],"will":[69,271],"involve":[70],"giving":[71],"robots":[73,127,184],"significantly":[74],"enhanced":[75],"autonomy,":[76],"when":[78,116],"it":[79],"comes":[80],"planning":[82,99,215,237],"precisely":[83],"what":[84],"aspects":[85],"environment":[88],"survey":[90],"sample.Much":[92],"research":[95,121],"path":[98],"has":[100,122],"focused":[101],"finding":[103,150],"minimal":[104],"cost":[105,249],"paths":[106,130,187,229,274],"between":[107,230],"two":[108],"points,":[109],"able":[112],"rapidly":[114],"re-plan":[115],"environmental":[117],"conditions":[118],"change.":[119],"Less":[120],"been":[123],"done":[124],"into":[125],"how":[126],"should":[128],"plan":[129,186],"allow":[132],"them":[133],"maximize":[135,191],"utility,":[136],"information":[139,192,257],"gathered.":[140],"One":[141],"primary":[144],"reasons":[145],"for":[146,182,226],"this":[147],"is":[148,158],"optimal":[152],"solution":[153],"maximization":[156],"problem":[157],"NP-hard,":[159],"thus":[161],"be":[163,211],"computed":[164],"a":[166,178,202,244],"tractable":[167,180],"amount":[168,255],"time,":[170],"much":[171],"less":[172],"real":[174],"time.This":[175],"dissertation":[176],"presents":[177],"computationally":[179],"method":[181],"allowing":[183],"can":[189],"approximately":[190],"gathered":[193],"while":[194],"satisfying":[195],"any":[196],"relevant":[197],"horizon":[198],"constraints,":[199],"deadline.":[203],"It":[204],"builds":[205],"atop":[206],"existing":[207],"algorithms":[208],"known":[209],"capable":[212],"rapid":[214],"re-planning,":[217],"D*.":[220],"The":[221],"algorithm":[222,270],"utilizes":[223],"methods":[225],"computing":[227],"lowest-cost":[228],"nodes":[231,239],"environment,":[234],"then":[236],"which":[238],"search":[241],"based":[242],"function":[245],"both":[247],"exploration":[251],"expected":[254],"contained":[258],"at":[259,277],"nodes.":[261],"Experimental":[262],"results":[263],"small":[265],"show":[267],"mostly":[272],"generate":[273],"least":[278],"75%":[279],"optimal.":[281]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}