Difference between revisions of "Ariel Felner"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 20: | Line 20: | ||
* [[Eli David|Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/11674399_13 Blockage Detection in Pawn Endings]''. [[CG 2004]], [http://www.ise.bgu.ac.il/faculty/felner/newsite/publications/blockage.pdf pdf] | * [[Eli David|Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/11674399_13 Blockage Detection in Pawn Endings]''. [[CG 2004]], [http://www.ise.bgu.ac.il/faculty/felner/newsite/publications/blockage.pdf pdf] | ||
* [[Eli David|Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''Blockage Detection in Pawn Endgames''. [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]] | * [[Eli David|Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''Blockage Detection in Pawn Endgames''. [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]] | ||
| − | * [[Ariel Felner]], [[Roni Stern]], [[Sarit Kraus]], [https://dblp.uni-trier.de/pers/b/Ben=Yair:Asaph.html Asaph Ben-Yair], [[Nathan S. Netanyahu]] ('''2004'''). ''PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 21, [https://www.aaai.org/Papers/JAIR/Vol21/JAIR-2119.pdf pdf] | + | * [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [[Sarit Kraus]], [https://dblp.uni-trier.de/pers/b/Ben=Yair:Asaph.html Asaph Ben-Yair], [[Nathan S. Netanyahu]] ('''2004'''). ''PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 21, [https://www.aaai.org/Papers/JAIR/Vol21/JAIR-2119.pdf pdf] |
==2005 ...== | ==2005 ...== | ||
* [[Ariel Felner]], [[Uzi Zahavi]], [[Jonathan Schaeffer]], [[Robert Holte]] ('''2005'''). ''Dual Lookups in Pattern Databases''. [[Conferences#IJCAI2005|IJCAI 2005]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/ijcai05pdb.pdf pdf] | * [[Ariel Felner]], [[Uzi Zahavi]], [[Jonathan Schaeffer]], [[Robert Holte]] ('''2005'''). ''Dual Lookups in Pattern Databases''. [[Conferences#IJCAI2005|IJCAI 2005]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/ijcai05pdb.pdf pdf] | ||
| Line 34: | Line 34: | ||
* [https://dblp.uni-trier.de/pers/hd/n/Nash:Alex Alex Nash], [https://dblp.uni-trier.de/pers/hd/d/Daniel:Kenny Kenny Daniel], [[Mathematician#SKoenig|Sven Koenig]], [[Ariel Felner]] ('''2010'''). ''Theta*: Any-Angle Path Planning on Grids''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 39, [https://arxiv.org/abs/1401.3843 arXiv:1401.3843] | * [https://dblp.uni-trier.de/pers/hd/n/Nash:Alex Alex Nash], [https://dblp.uni-trier.de/pers/hd/d/Daniel:Kenny Kenny Daniel], [[Mathematician#SKoenig|Sven Koenig]], [[Ariel Felner]] ('''2010'''). ''Theta*: Any-Angle Path Planning on Grids''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 39, [https://arxiv.org/abs/1401.3843 arXiv:1401.3843] | ||
* [[Ariel Felner]], [[Carsten Moldenhauer]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Single-Frontier Bidirectional Search''. [[Conferences#AAAI-2010|AI 2010]], [http://www.ise.bgu.ac.il/faculty/felner/newsite/publications/sfbdsaaai.pdf pdf], [http://webdocs.cs.ualberta.ca/%7Ejonathan/publications/ai_publications/sfbds.pdf pdf] | * [[Ariel Felner]], [[Carsten Moldenhauer]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Single-Frontier Bidirectional Search''. [[Conferences#AAAI-2010|AI 2010]], [http://www.ise.bgu.ac.il/faculty/felner/newsite/publications/sfbdsaaai.pdf pdf], [http://webdocs.cs.ualberta.ca/%7Ejonathan/publications/ai_publications/sfbds.pdf pdf] | ||
| − | * [[Meir Goldenberg]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Portal-Based True-Distance Heuristics for Path Finding''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2010], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/portals.pdf pdf] | + | * [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Portal-Based True-Distance Heuristics for Path Finding''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2010], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/portals.pdf pdf] |
* [[Robert Holte]], [[Jonathan Schaeffer]], [[Ariel Felner]] ('''2010'''). ''Mechanical Generation of Admissible Heuristics''. Chapter 3 in ''[http://bayes.cs.ucla.edu/TRIBUTE/pearl-tribute2010.htm Heuristics, Probability, and Causality]: A Tribute to [[Judea Pearl]]'', edited by [http://www.ics.uci.edu/~dechter/ Rina Dechter], [http://www.dtic.upf.edu/~hgeffner/ Hector Geffner], [http://www.cs.cornell.edu/home/halpern/ Joseph Y. Halpern], [http://webdocs.cs.ualberta.ca/~holte/Publications/pearlBookChapter.pdf pdf] | * [[Robert Holte]], [[Jonathan Schaeffer]], [[Ariel Felner]] ('''2010'''). ''Mechanical Generation of Admissible Heuristics''. Chapter 3 in ''[http://bayes.cs.ucla.edu/TRIBUTE/pearl-tribute2010.htm Heuristics, Probability, and Causality]: A Tribute to [[Judea Pearl]]'', edited by [http://www.ics.uci.edu/~dechter/ Rina Dechter], [http://www.dtic.upf.edu/~hgeffner/ Hector Geffner], [http://www.cs.cornell.edu/home/halpern/ Joseph Y. Halpern], [http://webdocs.cs.ualberta.ca/~holte/Publications/pearlBookChapter.pdf pdf] | ||
* [[Uzi Zahavi]], [[Ariel Felner]], [[Neil Burch]], [[Robert Holte]] ('''2010'''). ''Predicting the Performance of IDA* using Conditional Distributions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 37, [https://arxiv.org/abs/1401.3493 arXiv:1401.3493v1] <ref>[https://en.wikipedia.org/wiki/Iterative_deepening_A* Iterative deepening A* from Wikipedia]</ref> | * [[Uzi Zahavi]], [[Ariel Felner]], [[Neil Burch]], [[Robert Holte]] ('''2010'''). ''Predicting the Performance of IDA* using Conditional Distributions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 37, [https://arxiv.org/abs/1401.3493 arXiv:1401.3493v1] <ref>[https://en.wikipedia.org/wiki/Iterative_deepening_A* Iterative deepening A* from Wikipedia]</ref> | ||
* [[Ariel Felner]], [[Uzi Zahavi]], [[Robert Holte]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]], [[Zhifu Zhang]] ('''2011'''). ''Inconsistent Heuristics in Theory and Practice''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, [https://www.cs.du.edu/~sturtevant/papers/incnew.pdf pdf] | * [[Ariel Felner]], [[Uzi Zahavi]], [[Robert Holte]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]], [[Zhifu Zhang]] ('''2011'''). ''Inconsistent Heuristics in Theory and Practice''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, [https://www.cs.du.edu/~sturtevant/papers/incnew.pdf pdf] | ||
| − | * [[Roni Stern]], [[Ariel Felner]], [[Robert Holte]] ('''2011'''). ''Probably Approximately Correct Heuristic Search''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2011] | + | * [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [[Robert Holte]] ('''2011'''). ''Probably Approximately Correct Heuristic Search''. [https://en.wikipedia.org/wiki/Symposium_on_Combinatorial_Search SOCS 2011] |
| − | * [[Guni Sharon]], [[Roni Stern]], [[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] |
| − | * [[Meir Goldenberg]], [[Ariel Felner]], [[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] |
* [[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] | ||
| − | * [[Meir Goldenberg]], [[Ariel Felner]], [[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 |
==2015 ...== | ==2015 ...== | ||
| − | * [https://dblp.uni-trier.de/pers/s/Surynek:Pavel.html Pavel Surynek], [[Ariel Felner]], [[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] |
* [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] | ||
| − | * [[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], [[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 | + | * [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 |
=External Links= | =External Links= | ||
Revision as of 13:13, 2 May 2020
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].
Contents
Selected Publications
1995
- Ariel Felner (1995). Searching for an Alternative Plan. M.Sc. thesis, Hebrew University of Jerusalem
2000 ...
- Ariel Felner (2002). Improving Search Techniques and using them in Different Environments. Ph.D. thesis, Advisor: Sarit Kraus and Richard E. Korf
- Richard Korf, Ariel Felner (2002). Disjoint Pattern Database Heuristics. Artificial Intelligence, Vol. 134, No. 1-2
- Richard Korf, Ariel Felner (2002). Disjoint Pattern Database Heuristics. in Jonathan Schaeffer, Jaap van den Herik (eds.) (2002). Chips Challenging Champions: Games, Computers and Artificial Intelligence. Elsevier Science
- Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endings. CG 2004, pdf
- Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
- Ariel Felner, Roni Stern, Sarit Kraus, Asaph Ben-Yair, Nathan S. Netanyahu (2004). PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. JAIR, Vol. 21, pdf
2005 ...
- Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Robert Holte (2005). Dual Lookups in Pattern Databases. IJCAI 2005, pdf
- Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan Schaeffer (2006). Dual Search in Permutation State Spaces. AAAI 2006, pdf
- Ariel Felner, Richard Korf, Ram Meshulam, Robert Holte (2007). Compressed Pattern Databases. JAIR, Vol. 30, pdf
- Richard Korf, Ariel Felner (2007). Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. IJCAI 2007, pdf
- Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner (2007). Theta*: Any-Angle Path Planning on Grids. AI 2007
- Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan Schaeffer (2008). Duality in Permutation State Spaces and the Dual Search Algorithm. Artificial Intelligence, Vol. 172, pdf
- Mehdi Samadi, Ariel Felner, Jonathan Schaeffer (2008). Learning from Multiple Heuristics. AI 2008, pdf
- Fan Yang, Joe Culberson, Robert Holte, Uzi Zahavi, Ariel Felner (2008). A General Theory of Additive State Space Abstractions. JAIR, Vol. 32, arXiv:1111.0067
- Nathan Sturtevant, Ariel Felner, Max Barrer, Jonathan Schaeffer, Neil Burch (2009). Memory-Based Heuristics for Explicit State Spaces. IJCAI 2009, pdf
2010 ...
- Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner (2010). Theta*: Any-Angle Path Planning on Grids. JAIR, Vol. 39, arXiv:1401.3843
- Ariel Felner, Carsten Moldenhauer, Nathan Sturtevant, Jonathan Schaeffer (2010). Single-Frontier Bidirectional Search. AI 2010, pdf, pdf
- Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer (2010). Portal-Based True-Distance Heuristics for Path Finding. SOCS 2010, pdf
- Robert Holte, Jonathan Schaeffer, Ariel Felner (2010). Mechanical Generation of Admissible Heuristics. Chapter 3 in Heuristics, Probability, and Causality: A Tribute to Judea Pearl, edited by Rina Dechter, Hector Geffner, Joseph Y. Halpern, pdf
- Uzi Zahavi, Ariel Felner, Neil Burch, Robert Holte (2010). Predicting the Performance of IDA* using Conditional Distributions. JAIR, Vol. 37, arXiv:1401.3493v1 [7]
- Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang (2011). Inconsistent Heuristics in Theory and Practice. Artificial Intelligence, Vol. 175, pdf
- Roni Stern, Ariel Felner, Robert Holte (2011). Probably Approximately Correct Heuristic Search. SOCS 2011
- Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner (2011). The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI 2011, pdf
- Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer (2012). A* Variants for Optimal Multi-Agent Pathfinding. SOCS 2012, pdf
- Guni Sharon, Ariel Felner, Nathan Sturtevant (2014). Exponential Deepening A* for Real-Time Agent-Centered Search. AI 2014, ext. abstract as pdf
- Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer (2014). Enhanced Partial Expansion A*. JAIR, Vol. 50
2015 ...
- Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski (2017). Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. arXiv:1707.00228
- Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig (2018). Multi-Agent Path Finding with Deadlines. arXiv:1806.04216
- Roni Stern, Nathan Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták (2019). Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. arXiv:1906.08291
2020 ...
- Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou (2020). Robust Multi-Agent Path Finding and Executing. JAIR, Vol. 67
External Links
References
- ↑ Ariel Felner Home
- ↑ Ariel Felner (2002). Improving Search Techniques and using them in Different Environments. Ph.D. thesis, advisor: Sarit Kraus and Richard E. Korf
- ↑ Mapf.info
- ↑ Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
- ↑ Ariel Felner - Publications
- ↑ dblp: Ariel Felner
- ↑ Iterative deepening A* from Wikipedia
