Difference between revisions of "Ariel Felner"

From Chessprogramming wiki
Jump to: navigation, search
Line 23: Line 23:
 
==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]
 +
* [[Uzi Zahavi]], [[Ariel Felner]], [[Robert Holte]], [[Jonathan Schaeffer]] ('''2006'''). ''Dual Search in Permutation State Spaces''. [[Conferences#AAAI-2006|AAAI 2006]], [https://www.aaai.org/Papers/AAAI/2006/AAAI06-169.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]
 
* [[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]
 
* [[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]

Revision as of 20:24, 1 May 2020

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