{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:23:48Z","timestamp":1768008228653,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/tg.2019.2937780","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:29:00Z","timestamp":1566847740000},"page":"35-49","source":"Crossref","is-referenced-by-count":1,"title":["Bounded-Search Pathfinders Based on Influence Maps Generated by Attractors and Repulsors"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5798-2701","authenticated-orcid":false,"given":"Goncalo N. P.","family":"Amador","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5804-5717","authenticated-orcid":false,"given":"Abel J. P.","family":"Gomes","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2008.921540"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094790"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/cav.1622"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2522628.2522654"},{"key":"ref31","first-page":"1","article-title":"Algoritmo de Dijkstra com mapa de influência de atratores e repulsores (in Portuguese)","author":"adaixo","year":"2015","journal-title":"Proc Portuguese Conf Sci Art in Video Games"},{"key":"ref30","first-page":"173","article-title":"Risk-adverse pathfinding using influence maps","author":"paanakker","year":"2008","journal-title":"AI Game Programming Wisdom 4"},{"key":"ref37","author":"gonzalez","year":"2007","journal-title":"Digital Image Processing"},{"key":"ref36","first-page":"1177","article-title":"Theta*: Any-angle path planning on grids","author":"nash","year":"2007","journal-title":"Proc 22nd Nat Conf Artif Intell"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/5184605"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2897826.2927310"},{"key":"ref28","article-title":"Potential Fields Tutorial","author":"goodrich","year":"2000","journal-title":"Internet"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1476793.1476819"},{"key":"ref29","first-page":"122","article-title":"A behavior architecture for autonomous mobile robots based on potential fields","author":"laue","year":"2004","journal-title":"RoboCup-02 Robot Soccer World Cup VI"},{"key":"ref2","author":"russell","year":"2003","journal-title":"Artificial Intelligence A Modern Approach"},{"key":"ref1","author":"poole","year":"1997","journal-title":"Computational Intelligence A Logical Approach"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"ref22","first-page":"262","article-title":"Anytime dynamic A*: An anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"Proc 15th Int Conf Int Conf Autom Planning Scheduling"},{"key":"ref21","first-page":"1652","article-title":"The focussed D* algorithm for real-time replanning","author":"stentz","year":"1995","journal-title":"Proc 14th Int Joint Conf Artif Intell"},{"key":"ref24","article-title":"Time-optimal active decision making","author":"allen","year":"2011"},{"key":"ref23","first-page":"469","article-title":"Generalized Adaptive A*","author":"sun","year":"0","journal-title":"Proc Int Joint Conf Autonomous Agents and Multiagent Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/0717021"},{"key":"ref10","first-page":"7","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"botea","year":"2004","journal-title":"J Game Develop"},{"key":"ref11","first-page":"1353","article-title":"ITS: An efficient limited-memory heuristic tree search algorithm","author":"ghosh","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509263"},{"key":"ref12","first-page":"219","article-title":"First results on the effect of error in heuristic search","volume":"5","author":"pohl","year":"1969","journal-title":"Mach Intell"},{"key":"ref13","first-page":"12","article-title":"The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving","author":"pohl","year":"1973","journal-title":"Proc 3rd Int Joint Conf Artif Intell"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1609\/icaps.v19i1.13390","article-title":"Using Distance Estimates in Heuristic Search","author":"thayer","year":"2009","journal-title":"Proc 19th Int Conf Autom Planning Scheduling"},{"key":"ref15","first-page":"355","article-title":"Faster than weighted A*: An optimal approach to bounded suboptimal search","author":"thayer","year":"2008","journal-title":"Proc 18th Int Conf Autom Planning Scheduling"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1609\/socs.v1i1.18173","article-title":"Finding acceptable solutions faster using inadmissible information","author":"thayer","year":"2010","journal-title":"Proc 3rd Annu Symp Combinatorial Search"},{"key":"ref17","first-page":"125","article-title":"Fringe search: Beating A* at pathfinding on game maps","author":"bj\u00f6rnsson","year":"0","journal-title":"Proc IEEE Symp Comput Intell Games"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8997-2_29"},{"key":"ref3","author":"nilsson","year":"1998","journal-title":"Artificial Intelligence A New Synthesis"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840369"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1117\/12.937802"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4108\/icst.bodynets.2012.249929"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44687-7_73"},{"key":"ref49","first-page":"264","article-title":"A* aesthetic optimizations","author":"rabin","year":"2000","journal-title":"Game Programming Gems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SISY.2008.4664953"},{"key":"ref46","article-title":"A survey of shortest-path algorithms","author":"madkour","year":"2017"},{"key":"ref45","first-page":"122","article-title":"Automated decomposition of game maps","author":"halld\u00f3rsson","year":"2015","journal-title":"Proc 11th AAAI Conf Artif Intell Interactive Digit Entertainment"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2915926.2915935"},{"key":"ref47","first-page":"305","article-title":"Complexity analysis admissible heuristic search","author":"korf","year":"1998","journal-title":"Proc 15th Nat \/10th Conf Artif Intell \/Innovative Appl Artif Intell"},{"key":"ref42","article-title":"Dragon Age Official Website","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/357994.358023"},{"key":"ref43","article-title":"Warcraft III Official Website","year":"0"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/9379970\/08812974.pdf?arnumber=8812974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:46:52Z","timestamp":1695127612000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8812974\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":50,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tg.2019.2937780","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"value":"2475-1502","type":"print"},{"value":"2475-1510","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}