Difference between revisions of "Ariel Felner"
GerdIsenberg (talk | contribs) (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...") |
GerdIsenberg (talk | contribs) |
||
| Line 4: | Line 4: | ||
'''Ariel Felner''',<br/> | '''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: [[ | + | 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: [[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>. | 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. | 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. | ||
| Line 15: | Line 15: | ||
* [[Ariel Felner]] ('''1995'''). ''Searching for an Alternative Plan''. M.Sc. thesis, [https://en.wikipedia.org/wiki/Hebrew_University_of_Jerusalem Hebrew University of Jerusalem] | * [[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 ...== | ==2000 ...== | ||
| − | * [[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, Advisor: [[ | + | * [[Ariel Felner]] ('''2002'''). ''Improving Search Techniques and using them in Different Environments''. Ph.D. thesis, Advisor: [[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''. [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] | * [[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'''). ''[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]], [[ | + | * [[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] |
==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] | ||
Revision as of 23:43, 30 April 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
- 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
- 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
- Uzi Zahavi, Ariel Felner, Neil Burch, Robert Holte (2014). Predicting the Performance of IDA* using Conditional Distributions. arXiv:1401.3493v1 [7]
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
