World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
46
Citations
8840
World Ranking
6840
National Ranking
109

Overview

Ariel Felner is affiliated with Ben-Gurion University of the Negev in Israel and has contributed extensively to the field of computer science, with a focus on artificial intelligence and optimization problems. Their research primarily addresses multi-agent pathfinding, search-based solvers, and various approaches to constraint satisfaction and optimization.

The scientist's research output includes numerous publications in key venues. Frequent publication venues comprise the Proceedings of the International Symposium on Combinatorial Search, Proceedings of the International Conference on Automated Planning and Scheduling, Proceedings of the AAAI Conference on Artificial Intelligence, arXiv (Cornell University), and the Journal of Artificial Intelligence Research.

Key recent papers by Ariel Felner include:

  • Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges, 2021, Proceedings of the International Symposium on Combinatorial Search
  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks, 2021, Proceedings of the International Symposium on Combinatorial Search
  • Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem, 2021, Proceedings of the International Symposium on Combinatorial Search
  • ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding, 2021, Proceedings of the International Symposium on Combinatorial Search
  • Conflict-Based Search For Optimal Multi-Agent Path Finding, 2021, Proceedings of the AAAI Conference on Artificial Intelligence

Frequent co-authors working alongside Ariel Felner include Roni Stern, Nathan Sturtevant, Sven Koenig, Dor Atzmon, and Shahaf Shperberg. These collaborations reflect a consistent involvement in multi-agent systems and planning research.

The main field of study is computer science, with important subfields encompassing:

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications
  • Industrial and Manufacturing Engineering
  • Signal Processing

Main topics covered by Ariel Felner's research include:

  • Robotic Path Planning Algorithms
  • Constraint Satisfaction and Optimization
  • Metaheuristic Optimization Algorithms Research
  • Vehicle Routing Optimization Methods
  • AI-based Problem Solving and Planning
  • Data Management and Algorithms
  • Optimization and Search Problems

Best Publications

  • Conflict-based search for optimal multi-agent pathfinding

    Guni Sharon;Roni Stern;Ariel Felner;Nathan R. Sturtevant

  • Theta*: any-angle path planning on grids

    Kenny Daniel;Alex Nash;Sven Koenig;Ariel Felner

  • Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem

    Max Barer;Guni Sharon;Roni Stern;Ariel Felner

  • The increasing cost tree search for optimal multi-agent pathfinding

    Guni Sharon;Roni Stern;Meir Goldenberg;Ariel Felner

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan R. Sturtevant;Ariel Felner;Sven Koenig

  • BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm

    William Yeoh;Ariel Felner;Sven Koenig

  • Disjoint pattern database heuristics

    Richard E. Korf;Ariel Felner

  • Additive pattern database heuristics

    Ariel Felner;Richard E. Korf;Sarit Hanan

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan Sturtevant;Ariel Felner;Sven Koenig

  • ICBS: improved conflict-based search algorithm for multi-agent pathfinding

    Eli Boyarski;Ariel Felner;Roni Stern;Guni Sharon

  • Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges

    Ariel Felner;Roni Stern;Solomon Eyal Shimony;Eli Boyarski

  • ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

    Eli Boyarski;Ariel Felner;Roni Stern;Guni Sharon

  • Enhanced partial expansion A

    Meir Goldenberg;Ariel Felner;Roni Stern;Guni Sharon

  • Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding

    Ariel Felner;Jiaoyang Li;Eli Boyarski;Hang Ma

  • Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.

    Pavel Surynek;Ariel Felner;Roni Stern;Eli Boyarski

  • Multi-Agent Path Finding for Large Agents

    Jiaoyang Li;Pavel Surynek;Ariel Felner;Hang Ma

  • Memory-based heuristics for explicit state spaces

    Nathan R. Sturtevant;Ariel Felner;Max Barrer;Jonathan Schaeffer

  • Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search

    Jiaoyang Li;Ariel Felner;Eli Boyarski;Hang Ma

  • Conflict-based search for optimal multi-agent path finding

    Guni Sharon;Roni Stern;Ariel Felner;Nathan Sturtevant

  • A general theory of additive state space abstractions

    Fan Yang;Joseph Culberson;Robert Holte;Uzi Zahavi

  • A* search with inconsistent heuristics

    Zhifu Zhang;Nathan R. Sturtevant;Robert Holte;Jonathan Schaeffer

  • Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding

    Guni Sharon;Roni Tzvi Stern;Meir Goldenberg;Ariel Felner

  • ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding: Extended Abstract

    Eli Boyarski;Ariel Felner;Roni Stern;Guni Sharon

Frequent Co-Authors

Nathan R. Sturtevant
Nathan R. Sturtevant University of Alberta
Robert C. Holte
Robert C. Holte University of Alberta
Sven Koenig
Sven Koenig University of Southern California
Jonathan Schaeffer
Jonathan Schaeffer University of Alberta
Richard E. Korf
Richard E. Korf University of California, Los Angeles
Peter J. Stuckey
Peter J. Stuckey Monash University
Jeffrey S. Rosenschein
Jeffrey S. Rosenschein Hebrew University of Jerusalem
Sarit Kraus
Sarit Kraus Bar-Ilan University
Malte Helmert
Malte Helmert University of Basel
Neil Burch
Neil Burch University of Alberta

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a wide range of online degrees and career options. If you want to build your tech expertise quickly, consider enrolling in a fastest computer science degree program, which can help you earn your qualification in less time.

Computer science also pairs well with related fields, expanding your career possibilities. For example, you might be curious about what can you do with an environmental studies degree. Many graduates work in data analysis, research, or sustainability tech roles.

Engineering and computer science are deeply connected. If you’re seeking a tech-driven path in sustainability, explore options for an environmental engineering degree. Likewise, mechanical engineering offers strong interdisciplinary potential—especially with the cheapest mechanical engineering degree online options available.

Overall, online degrees make it easier than ever to blend computer science with other technical fields, allowing you to carve out a unique and forward-thinking career path.

Best Scientists Citing Ariel Felner

Trending Scientists