Difference between revisions of "Ariel Felner"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 41: Line 41:
 
* [[Guni Sharon]], [[Mathematician#RoniStern|Roni Stern]], [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]] ('''2011'''). ''The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding''. [[Conferences#IJCA|IJCAI 2011]], [http://ijcai.org/papers11/Papers/IJCAI11-117.pdf pdf]
 
* [[Guni Sharon]], [[Mathematician#RoniStern|Roni Stern]], [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]] ('''2011'''). ''The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding''. [[Conferences#IJCA|IJCAI 2011]], [http://ijcai.org/papers11/Papers/IJCAI11-117.pdf pdf]
 
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [[Guni Sharon]], [[Jonathan Schaeffer]] ('''2012'''). ''A* Variants for Optimal Multi-Agent Pathfinding''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2012], [http://www.aaai.org/ocs/index.php/WS/AAAIW12/paper/viewFile/5233/5640 pdf]  
 
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [[Guni Sharon]], [[Jonathan Schaeffer]] ('''2012'''). ''A* Variants for Optimal Multi-Agent Pathfinding''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2012], [http://www.aaai.org/ocs/index.php/WS/AAAIW12/paper/viewFile/5233/5640 pdf]  
 +
* [[Nathan Sturtevant]], [[Ariel Felner]], [[Maxim Likhachev]], [[Wheeler Rum]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Heuristic-Search-Comes-of-Age-Sturtevant-Felner/18e0bf9e6f28e151c0cf60ba1e962f0c1fb6ed23 Heuristic Search Comes of Age]''. [[Conferences#AAAI-2012|AAAI 2012]]
 
* [[Guni Sharon]], [[Ariel Felner]], [[Nathan Sturtevant]] ('''2014'''). ''Exponential Deepening A* for Real-Time Agent-Centered Search''. [[Conferences#AAAI-2014|AI 2014]], [https://www.aaai.org/ocs/index.php/SOCS/SOCS14/paper/viewFile/8916/8903 ext. abstract as pdf]  
 
* [[Guni Sharon]], [[Ariel Felner]], [[Nathan Sturtevant]] ('''2014'''). ''Exponential Deepening A* for Real-Time Agent-Centered Search''. [[Conferences#AAAI-2014|AI 2014]], [https://www.aaai.org/ocs/index.php/SOCS/SOCS14/paper/viewFile/8916/8903 ext. abstract as pdf]  
 
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]],  [[Guni Sharon]], [[Nathan Sturtevant]], [[Robert Holte|Robert C. Holte]], [[Jonathan Schaeffer]] ('''2014'''). ''[https://www.jair.org/index.php/jair/article/view/10882 Enhanced Partial Expansion A*]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 50
 
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]],  [[Guni Sharon]], [[Nathan Sturtevant]], [[Robert Holte|Robert C. Holte]], [[Jonathan Schaeffer]] ('''2014'''). ''[https://www.jair.org/index.php/jair/article/view/10882 Enhanced Partial Expansion A*]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 50
Line 46: Line 47:
 
==2015 ...==
 
==2015 ...==
 
* [https://dblp.uni-trier.de/pers/s/Surynek:Pavel.html Pavel Surynek], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [https://dblp.uni-trier.de/pers/hd/b/Boyarski:Eli Eli Boyarski] ('''2017'''). ''Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants''. [https://arxiv.org/abs/1707.00228 arXiv:1707.00228]  
 
* [https://dblp.uni-trier.de/pers/s/Surynek:Pavel.html Pavel Surynek], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [https://dblp.uni-trier.de/pers/hd/b/Boyarski:Eli Eli Boyarski] ('''2017'''). ''Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants''. [https://arxiv.org/abs/1707.00228 arXiv:1707.00228]  
 +
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Alon Palombo]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2017'''). ''[https://content.iospress.com/articles/ai-communications/aic743 The compressed differential heuristic]''. [https://www.iospress.nl/journal/ai-communications/ AI Communications], Vol. 30, No. 6
 
* [https://dblp.uni-trier.de/pers/hd/m/Ma_0001:Hang Hang Ma], [https://dblp.uni-trier.de/pers/hd/w/Wagner:Glenn Glenn Wagner], [[Ariel Felner]], [https://scholar.google.com/citations?user=F5qzvmkAAAAJ&hl=en Jiaoyang Li], [https://www.tkskwork.org/ T. K. Satish Kumar], [[Mathematician#SKoenig|Sven Koenig]] ('''2018'''). ''Multi-Agent Path Finding with Deadlines''. [https://arxiv.org/abs/1806.04216 arXiv:1806.04216]
 
* [https://dblp.uni-trier.de/pers/hd/m/Ma_0001:Hang Hang Ma], [https://dblp.uni-trier.de/pers/hd/w/Wagner:Glenn Glenn Wagner], [[Ariel Felner]], [https://scholar.google.com/citations?user=F5qzvmkAAAAJ&hl=en Jiaoyang Li], [https://www.tkskwork.org/ T. K. Satish Kumar], [[Mathematician#SKoenig|Sven Koenig]] ('''2018'''). ''Multi-Agent Path Finding with Deadlines''. [https://arxiv.org/abs/1806.04216 arXiv:1806.04216]
 +
* [[Nathan Sturtevant]], [[Ariel Felner]] ('''2018'''). ''A Brief History and Recent Achievements in Bidirectional Search''. [[Conferences#AAAI-2018|AAAI 2018]]
 
* [[Mathematician#RoniStern|Roni Stern]], [[Nathan Sturtevant]], [[Ariel Felner]], [[Mathematician#SKoenig|Sven Koenig]], [https://dblp.uni-trier.de/pers/hd/m/Ma_0001:Hang Hang Ma], [https://scholar.google.com/citations?user=xA_sPpkAAAAJ&hl=en Thayne Walker], [https://scholar.google.com/citations?user=F5qzvmkAAAAJ&hl=en Jiaoyang Li], [https://scholar.google.com/citations?user=KchnD40AAAAJ&hl=en Dor Atzmon], [https://www.cs.bgu.ac.il/~cliron/ Liron Cohen], [https://www.tkskwork.org/ T. K. Satish Kumar], [https://dblp.uni-trier.de/pers/hd/b/Boyarski:Eli Eli Boyarski], [https://ktiml.mff.cuni.cz/~bartak/ Roman Barták] ('''2019'''). ''Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks''. [https://arxiv.org/abs/1906.08291 arXiv:1906.08291]
 
* [[Mathematician#RoniStern|Roni Stern]], [[Nathan Sturtevant]], [[Ariel Felner]], [[Mathematician#SKoenig|Sven Koenig]], [https://dblp.uni-trier.de/pers/hd/m/Ma_0001:Hang Hang Ma], [https://scholar.google.com/citations?user=xA_sPpkAAAAJ&hl=en Thayne Walker], [https://scholar.google.com/citations?user=F5qzvmkAAAAJ&hl=en Jiaoyang Li], [https://scholar.google.com/citations?user=KchnD40AAAAJ&hl=en Dor Atzmon], [https://www.cs.bgu.ac.il/~cliron/ Liron Cohen], [https://www.tkskwork.org/ T. K. Satish Kumar], [https://dblp.uni-trier.de/pers/hd/b/Boyarski:Eli Eli Boyarski], [https://ktiml.mff.cuni.cz/~bartak/ Roman Barták] ('''2019'''). ''Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks''. [https://arxiv.org/abs/1906.08291 arXiv:1906.08291]
 
==2020 ...==
 
==2020 ...==
* [https://scholar.google.com/citations?user=KchnD40AAAAJ&hl=en Dor Atzmon], [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [https://dblp.uni-trier.de/pers/hd/w/Wagner:Glenn Glenn Wagner], [https://ktiml.mff.cuni.cz/~bartak/ Roman Barták], [http://www.sci.brooklyn.cuny.edu/~zhou/ Neng-Fa Zhou] ('''2020'''). ''[https://www.jair.org/index.php/jair/article/view/11734 Robust Multi-Agent Path Finding and Executing]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 67
+
* [[Dor Atzmon]], [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [https://dblp.uni-trier.de/pers/hd/w/Wagner:Glenn Glenn Wagner], [https://ktiml.mff.cuni.cz/~bartak/ Roman Barták], [http://www.sci.brooklyn.cuny.edu/~zhou/ Neng-Fa Zhou] ('''2020'''). ''[https://www.jair.org/index.php/jair/article/view/11734 Robust Multi-Agent Path Finding and Executing]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 67
 +
* [[Dor Atzmon]], [[Jiaoyang Li]], [[Ariel Felner]], [[Eliran Nachmani]], [[Shahaf S. Shperberg]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://www.ijcai.org/Proceedings/2020/562 Multi-Directional Heuristic Search]''. [[Conferences#IJCAI2020|IJCAI 2020]]
 +
* [[Dor Atzmon]], [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://ojs.aaai.org//index.php/ICAPS/article/view/6642 Probabilistic Robust Multi-Agent Path Finding]''. [https://dblp.uni-trier.de/db/conf/aips/icaps2020.html#AtzmonSFSK20 ICAPS 2020]
  
 
=External Links=  
 
=External Links=  

Latest revision as of 12:19, 7 April 2021

Home * People * Ariel Felner

Ariel Felner [1]

Ariel Felner,
an Israeli computer scientist and full professor at Ben-Gurion University, Ph.D. in 2002 from Bar-Ilan University [2]. His research interests include heuristic search, pattern database heuristics, pathfinding and A*, in particular any-angle path planning, mobile agents and multi-agent pathfinding (MAPF) [3]. Pattern databases are large tables that store solutions to "patterns" or subproblems and are usually stored in main memory. These solutions are then used as heuristics that guide the search. Along with Omid David and Nathan S. Netanyahu, he worked and published on blockage detection in pawn endgames [4].

Selected Publications

[5] [6]

1995

2000 ...

2005 ...

2010 ...

2015 ...

2020 ...

External Links

References

  1. Ariel Felner Home
  2. Ariel Felner (2002). Improving Search Techniques and using them in Different Environments. Ph.D. thesis, advisor: Sarit Kraus and Richard E. Korf
  3. Mapf.info
  4. Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
  5. Ariel Felner - Publications
  6. dblp: Ariel Felner
  7. Iterative deepening A* from Wikipedia

Up one level