{"id":"https://openalex.org/W1992298963","doi":"https://doi.org/10.1177/0278364910396551","title":"Generalizing foraging theory for analysis and design","display_name":"Generalizing foraging theory for analysis and design","publication_year":2011,"publication_date":"2011-02-18","ids":{"openalex":"https://openalex.org/W1992298963","doi":"https://doi.org/10.1177/0278364910396551","mag":"1992298963"},"language":"en","primary_location":{"id":"doi:10.1177/0278364910396551","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364910396551","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-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/A5005386595","display_name":"Theodore P. Pavlic","orcid":"https://orcid.org/0000-0002-7073-6932"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Theodore P Pavlic","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA,","Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA, pavlic.3@osu.edu#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA,","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA, pavlic.3@osu.edu#N#","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043940203","display_name":"Kevin M. Passino","orcid":"https://orcid.org/0000-0003-3918-5391"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin M Passino","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ohio State University, Columbus, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005386595"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":2.2826,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87281649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"5","first_page":"505","last_page":"523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9624000191688538,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9480000138282776,"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/foraging","display_name":"Foraging","score":0.8609049320220947},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6487284898757935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6416111588478088},{"id":"https://openalex.org/keywords/optimal-foraging-theory","display_name":"Optimal foraging theory","score":0.5655438303947449},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5529310703277588},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4633527100086212},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46120256185531616},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4548027217388153},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.42449888586997986},{"id":"https://openalex.org/keywords/profit-maximization","display_name":"Profit maximization","score":0.4144079089164734},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.34615570306777954},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.27701663970947266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1740575134754181},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14993509650230408},{"id":"https://openalex.org/keywords/ecology","display_name":"Ecology","score":0.10523128509521484}],"concepts":[{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.8609049320220947},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6487284898757935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6416111588478088},{"id":"https://openalex.org/C95812059","wikidata":"https://www.wikidata.org/wiki/Q277031","display_name":"Optimal foraging theory","level":3,"score":0.5655438303947449},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5529310703277588},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4633527100086212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46120256185531616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4548027217388153},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.42449888586997986},{"id":"https://openalex.org/C2777780509","wikidata":"https://www.wikidata.org/wiki/Q1377422","display_name":"Profit maximization","level":3,"score":0.4144079089164734},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.34615570306777954},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.27701663970947266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1740575134754181},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14993509650230408},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.10523128509521484},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364910396551","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364910396551","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W373450089","https://openalex.org/W607660952","https://openalex.org/W1549725623","https://openalex.org/W1748815599","https://openalex.org/W1977210158","https://openalex.org/W1983096747","https://openalex.org/W1984035009","https://openalex.org/W1984132513","https://openalex.org/W1996452952","https://openalex.org/W2000683508","https://openalex.org/W2014806195","https://openalex.org/W2015425837","https://openalex.org/W2019796286","https://openalex.org/W2030969361","https://openalex.org/W2046322862","https://openalex.org/W2049407105","https://openalex.org/W2051615106","https://openalex.org/W2060017427","https://openalex.org/W2069108894","https://openalex.org/W2072427374","https://openalex.org/W2087369095","https://openalex.org/W2090331353","https://openalex.org/W2091123269","https://openalex.org/W2100527071","https://openalex.org/W2106695823","https://openalex.org/W2109915587","https://openalex.org/W2115805759","https://openalex.org/W2122122715","https://openalex.org/W2126654967","https://openalex.org/W2137670390","https://openalex.org/W2142180526","https://openalex.org/W2313274380","https://openalex.org/W2317769073","https://openalex.org/W2324192361","https://openalex.org/W2333773972","https://openalex.org/W2340493535","https://openalex.org/W2487739765","https://openalex.org/W2798766386","https://openalex.org/W4205961728","https://openalex.org/W4235178178","https://openalex.org/W4238998169","https://openalex.org/W4292862031"],"related_works":["https://openalex.org/W1983444316","https://openalex.org/W2315789094","https://openalex.org/W2093276668","https://openalex.org/W4248406013","https://openalex.org/W2503827760","https://openalex.org/W2973804033","https://openalex.org/W88326050","https://openalex.org/W2133784518","https://openalex.org/W3010307207","https://openalex.org/W2000503930"],"abstract_inverted_index":{"Foraging":[0],"theory":[1,60,185],"has":[2],"been":[3],"the":[4,43,71,110,117,137,173,178],"inspiration":[5],"for":[6,10,19,88,128,146,162],"several":[7,79,150],"decision-making":[8,130],"algorithms":[9,131],"task-processing":[11,90,168],"agents":[12],"facing":[13],"random":[14],"environments.":[15],"As":[16],"nature":[17],"selects":[18],"foraging":[20,59,106,184],"behaviors":[21,169],"that":[22,35,69,84,155,170],"maximize":[23,36],"lifetime":[24],"calorie":[25],"gain":[26],"or":[27,41],"minimize":[28,42],"starvation":[29],"probability,":[30],"engineering":[31],"designs":[32,52],"are":[33,53,85,123],"favored":[34],"returned":[37],"value":[38],"(e.g.":[39],"profit)":[40],"probability":[44],"of":[45,56,99,113,120,166,182,190],"not":[46,108],"reaching":[47],"performance":[48],"targets.":[49],"Prior":[50],"foraging-inspired":[51],"direct":[54],"applications":[55,91],"classical":[57,72,114],"optimal":[58,135,167,183],"(OFT).":[61],"Here,":[62],"we":[63,140],"describe":[64],"a":[65,75,142,187],"generalized":[66],"optimization":[67,192],"framework":[68,145],"encompasses":[70],"OFT":[73],"model,":[74],"popular":[76],"competitor,":[77],"and":[78,104,125,152,159,164,197],"new":[80,95,151],"models":[81,96],"introduced":[82],"here":[83],"better":[86],"suited":[87],"some":[89],"in":[92,194],"engineering.":[93],"These":[94],"merge":[97],"features":[98,181],"rate":[100],"maximization,":[101,103],"efficiency":[102],"risk-sensitive":[105],"while":[107],"sacrificing":[109],"intuitive":[111],"character":[112],"OFT.":[115],"However,":[116],"central":[118],"contributions":[119],"this":[121],"paper":[122],"analytical":[124],"graphical":[126],"methods":[127,161],"designing":[129],"guaranteed":[132],"to":[133,157,186],"be":[134],"within":[136,172],"framework.":[138,174],"Thus,":[139],"provide":[141],"general":[143],"modeling":[144],"solitary":[147],"agent":[148],"behavior,":[149],"classic":[153],"examples":[154],"apply":[156],"it,":[158],"generic":[160],"design":[163],"analysis":[165],"fit":[171],"Our":[175],"results":[176],"extend":[177],"key":[179],"mathematical":[180],"wide":[188],"range":[189],"other":[191],"objectives":[193],"biological,":[195],"anthropological,":[196],"technological":[198],"contexts.":[199]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}