The increasing cost tree search for optimal multi-agent pathfinding
- Author
- SHARON, Guni1 ; STERN, Roni1 ; GOLDENBERG, Meir1 ; FELNER, Ariel1
[1] Information Systems Engineering, Ben Gurion University, Beer-Sheva, 85104, Israel - Source
Artificial intelligence (General ed.). 2013, Vol 195, pp 470-495, 26 p ; ref : 36 ref
- CODEN
- AINTBB
- ISSN
- 0004-3702
- Scientific domain
- Cognition; Computer science
- Publisher
- Elsevier, Oxford
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- Heuristic search Multi-agent pathfinding
- Keyword (fr)
- Agent intelligent Algorithme recherche Arbre graphe Arbre recherche Elagage Espace état Esquive collision Méthode espace état Méthode heuristique Routage Résolution problème Résultat expérimental Solution optimale Système multiagent
- Keyword (en)
- Intelligent agent Search algorithm Tree(graph) Search tree Pruning(tree) State space Collision avoidance State space method Heuristic method Routing Problem solving Experimental result Optimal solution Multiagent system
- Keyword (es)
- Agente inteligente Algoritmo búsqueda Arbol grafo Arbol investigación Poda Espacio estado Esquiva colisión Método espacio estado Método heurístico Enrutamiento Resolución problema Resultado experimental Solución óptima Sistema multiagente
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02D Control theory. Systems / 001D02D11 Robotics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 26901617
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.artint.2012.11.006 
https://dx.doi.org/10.1016/j.artint.2012.11.006
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2012.11.006\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2013\";s:9:\"\u0000*\u0000volume\";s:3:\"195\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"470\";s:8:\"\u0000*\u0000epage\";s:3:\"495\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"SHARON\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Guni\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"STERN, Roni\";i:1;s:16:\"GOLDENBERG, Meir\";i:2;s:13:\"FELNER, Ariel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"26\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2012.11.006\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2013\";s:9:\"\u0000*\u0000volume\";s:3:\"195\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"470\";s:8:\"\u0000*\u0000epage\";s:3:\"495\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"SHARON\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Guni\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"STERN, Roni\";i:1;s:16:\"GOLDENBERG, Meir\";i:2;s:13:\"FELNER, Ariel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"26\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2012.11.006\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2012.11.006\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2013\";s:9:\"\u0000*\u0000volume\";s:3:\"195\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"470\";s:8:\"\u0000*\u0000epage\";s:3:\"495\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"SHARON\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Guni\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"STERN, Roni\";i:1;s:16:\"GOLDENBERG, Meir\";i:2;s:13:\"FELNER, Ariel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"26\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2012.11.006\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2013\";s:9:\"\u0000*\u0000volume\";s:3:\"195\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"470\";s:8:\"\u0000*\u0000epage\";s:3:\"495\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"SHARON\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Guni\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"STERN, Roni\";i:1;s:16:\"GOLDENBERG, Meir\";i:2;s:13:\"FELNER, Ariel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:67:\"The increasing cost tree search for optimal multi-agent pathfinding\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"26\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
