25,161
edits
Changes
Created page with "'''Home * People * Ariel Felner''' FILE:ArielFelner.jpg|border|right|thumb|link=https://felner.wixsite.com/home| Ariel Felner <ref>[https://felner.wixsite..."
'''[[Main Page|Home]] * [[People]] * Ariel Felner'''
[[FILE:ArielFelner.jpg|border|right|thumb|link=https://felner.wixsite.com/home| Ariel Felner <ref>[https://felner.wixsite.com/home Ariel Felner Home]</ref> ]]
'''Ariel Felner''',<br/>
an Israeli computer scientist and full professor at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University], Ph.D. in 2002 from [[Bar-Ilan University]] <ref>[[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, advisor: [[Mathematician#SKraus|Sarit Kraus]] and [[Richard Korf|Richard E. Korf]]</ref>.
His research interests include [[Search|heuristic search]], pattern database heuristics, [https://en.wikipedia.org/wiki/Pathfinding pathfinding] and [https://en.wikipedia.org/wiki/A*_search_algorithm A*], in particular [https://en.wikipedia.org/wiki/Any-angle_path_planning any-angle path planning], [https://en.wikipedia.org/wiki/Mobile_agent mobile agents] and [https://en.wikipedia.org/wiki/Multi-agent_system multi-agent] pathfinding (MAPF) <ref>[http://mapf.info/ Mapf.info]</ref>.
Pattern databases are large tables that store solutions to "patterns" or subproblems and are usually stored in [[Memory|main memory]]. These solutions are then used as heuristics that guide the search.
Along with [[Eli David|Omid David]] and [[Nathan S. Netanyahu]], he worked and published on [[Blockage Detection|blockage detection]] in [[Pawn Endgame|pawn endgames]] <ref>[[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]]</ref>.
=Selected Publications=
<ref>[https://felner.wixsite.com/home/copy-of-publications-2 Ariel Felner - Publications]</ref>
<ref>[https://dblp.uni-trier.de/pers/f/Felner:Ariel.html dblp: Ariel Felner]</ref>
==1995==
* [[Ariel Felner]] ('''1995'''). ''Searching for an Alternative Plan''. M.Sc. thesis, [https://en.wikipedia.org/wiki/Hebrew_University_of_Jerusalem Hebrew University of Jerusalem]
==2000 ...==
* [[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, Advisor: [[Mathematician#SKraus|Sarit Kraus]] and [[Richard Korf|Richard E. Korf]]
* [[Richard Korf]], [[Ariel Felner]] ('''2002'''). ''Disjoint Pattern Database Heuristics''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) 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''. [https://en.wikipedia.org/wiki/Elsevier Elsevier Science]
* [[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]]
* [[Ariel Felner]], [[Roni Stern]], [[Mathematician#SKraus|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 ...==
* [[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]], [[Richard Korf]], [[Ram Meshulam]], [[Robert Holte]] ('''2007'''). ''Compressed Pattern Databases''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 30, [http://www.ise.bgu.ac.il/faculty/felner/research/newcompjur.pdf pdf]
* [[Richard Korf]], [[Ariel Felner]] ('''2007'''). ''Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem''. [[Conferences#IJCAI2007|IJCAI 2007]], [https://www.aaai.org/Papers/IJCAI/2007/IJCAI07-374.pdf pdf]
* [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]] ('''2007'''). ''[https://www.semanticscholar.org/paper/Theta*%3A-Any-Angle-Path-Planning-on-Grids-Nash-Daniel/34d4111436c1dbdff9ed612045d8516c2ee42eb0 Theta*: Any-Angle Path Planning on Grids]''. [[Conferences#AAAI-2007|AI 2007]]
* [[Uzi Zahavi]], [[Ariel Felner]], [[Robert Holte]], [[Jonathan Schaeffer]] ('''2008'''). ''Duality in Permutation State Spaces and the Dual Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 172, [https://webdocs.cs.ualberta.ca/~holte/Publications/aij2007dualdraft.pdf pdf]
* [[Mehdi Samadi]], [[Ariel Felner]], [[Jonathan Schaeffer]] ('''2008'''). ''Learning from Multiple Heuristics''. [[Conferences#AAAI-2008|AI 2008]], [https://www.aaai.org/Papers/AAAI/2008/AAAI08-056.pdf pdf]
* [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067]
* [[Nathan Sturtevant]], [[Ariel Felner]], [[Max Barrer]], [[Jonathan Schaeffer]], [[Neil Burch]] ('''2009'''). ''Memory-Based Heuristics for Explicit State Spaces''. [[Conferences#IJCAI2009|IJCAI 2009]], [https://www.cs.du.edu/~sturtevant/papers/TDH.pdf pdf]
==2010 ...==
* [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]
* [[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]
* [[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]
* [[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]
* [[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]
* [[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
* [[Uzi Zahavi]], [[Ariel Felner]], [[Neil Burch]], [[Robert Holte]] ('''2014'''). ''Predicting the Performance of IDA* using Conditional Distributions''. [https://arxiv.org/abs/1401.3493 arXiv:1401.3493v1] <ref>[https://en.wikipedia.org/wiki/Iterative_deepening_A* Iterative deepening A* from Wikipedia]</ref>
==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/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]
==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
=External Links=
* [https://felner.wixsite.com/home Ariel Felner Home]
* [https://scholar.google.co.il/citations?user=t4rXchwAAAAJ&hl=en Ariel Felner - Google Scholar Citations]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Felner]]
[[FILE:ArielFelner.jpg|border|right|thumb|link=https://felner.wixsite.com/home| Ariel Felner <ref>[https://felner.wixsite.com/home Ariel Felner Home]</ref> ]]
'''Ariel Felner''',<br/>
an Israeli computer scientist and full professor at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University], Ph.D. in 2002 from [[Bar-Ilan University]] <ref>[[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, advisor: [[Mathematician#SKraus|Sarit Kraus]] and [[Richard Korf|Richard E. Korf]]</ref>.
His research interests include [[Search|heuristic search]], pattern database heuristics, [https://en.wikipedia.org/wiki/Pathfinding pathfinding] and [https://en.wikipedia.org/wiki/A*_search_algorithm A*], in particular [https://en.wikipedia.org/wiki/Any-angle_path_planning any-angle path planning], [https://en.wikipedia.org/wiki/Mobile_agent mobile agents] and [https://en.wikipedia.org/wiki/Multi-agent_system multi-agent] pathfinding (MAPF) <ref>[http://mapf.info/ Mapf.info]</ref>.
Pattern databases are large tables that store solutions to "patterns" or subproblems and are usually stored in [[Memory|main memory]]. These solutions are then used as heuristics that guide the search.
Along with [[Eli David|Omid David]] and [[Nathan S. Netanyahu]], he worked and published on [[Blockage Detection|blockage detection]] in [[Pawn Endgame|pawn endgames]] <ref>[[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]]</ref>.
=Selected Publications=
<ref>[https://felner.wixsite.com/home/copy-of-publications-2 Ariel Felner - Publications]</ref>
<ref>[https://dblp.uni-trier.de/pers/f/Felner:Ariel.html dblp: Ariel Felner]</ref>
==1995==
* [[Ariel Felner]] ('''1995'''). ''Searching for an Alternative Plan''. M.Sc. thesis, [https://en.wikipedia.org/wiki/Hebrew_University_of_Jerusalem Hebrew University of Jerusalem]
==2000 ...==
* [[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, Advisor: [[Mathematician#SKraus|Sarit Kraus]] and [[Richard Korf|Richard E. Korf]]
* [[Richard Korf]], [[Ariel Felner]] ('''2002'''). ''Disjoint Pattern Database Heuristics''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) 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''. [https://en.wikipedia.org/wiki/Elsevier Elsevier Science]
* [[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]]
* [[Ariel Felner]], [[Roni Stern]], [[Mathematician#SKraus|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 ...==
* [[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]], [[Richard Korf]], [[Ram Meshulam]], [[Robert Holte]] ('''2007'''). ''Compressed Pattern Databases''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 30, [http://www.ise.bgu.ac.il/faculty/felner/research/newcompjur.pdf pdf]
* [[Richard Korf]], [[Ariel Felner]] ('''2007'''). ''Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem''. [[Conferences#IJCAI2007|IJCAI 2007]], [https://www.aaai.org/Papers/IJCAI/2007/IJCAI07-374.pdf pdf]
* [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]] ('''2007'''). ''[https://www.semanticscholar.org/paper/Theta*%3A-Any-Angle-Path-Planning-on-Grids-Nash-Daniel/34d4111436c1dbdff9ed612045d8516c2ee42eb0 Theta*: Any-Angle Path Planning on Grids]''. [[Conferences#AAAI-2007|AI 2007]]
* [[Uzi Zahavi]], [[Ariel Felner]], [[Robert Holte]], [[Jonathan Schaeffer]] ('''2008'''). ''Duality in Permutation State Spaces and the Dual Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 172, [https://webdocs.cs.ualberta.ca/~holte/Publications/aij2007dualdraft.pdf pdf]
* [[Mehdi Samadi]], [[Ariel Felner]], [[Jonathan Schaeffer]] ('''2008'''). ''Learning from Multiple Heuristics''. [[Conferences#AAAI-2008|AI 2008]], [https://www.aaai.org/Papers/AAAI/2008/AAAI08-056.pdf pdf]
* [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067]
* [[Nathan Sturtevant]], [[Ariel Felner]], [[Max Barrer]], [[Jonathan Schaeffer]], [[Neil Burch]] ('''2009'''). ''Memory-Based Heuristics for Explicit State Spaces''. [[Conferences#IJCAI2009|IJCAI 2009]], [https://www.cs.du.edu/~sturtevant/papers/TDH.pdf pdf]
==2010 ...==
* [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]
* [[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]
* [[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]
* [[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]
* [[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]
* [[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
* [[Uzi Zahavi]], [[Ariel Felner]], [[Neil Burch]], [[Robert Holte]] ('''2014'''). ''Predicting the Performance of IDA* using Conditional Distributions''. [https://arxiv.org/abs/1401.3493 arXiv:1401.3493v1] <ref>[https://en.wikipedia.org/wiki/Iterative_deepening_A* Iterative deepening A* from Wikipedia]</ref>
==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/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]
==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
=External Links=
* [https://felner.wixsite.com/home Ariel Felner Home]
* [https://scholar.google.co.il/citations?user=t4rXchwAAAAJ&hl=en Ariel Felner - Google Scholar Citations]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Felner]]
