CS Colloquium: Ariel Felner (Ben-Gurion University) - Search for Optimal Solutions: the Heart of Heuristic Search is Still Beating
Fri, Dec 02, 2016 @ 12:00 PM - 01:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Ariel Felner, Ben-Gurion University
Talk Title: Search for Optimal Solutions: the Heart of Heuristic Search is Still Beating
Series: CS Colloquium
Abstract: The field of heuristic search has spawned large number of subfields such as finding good heuristics, abstracting state-spaces, finding solutions of different qualities or that meet different requirements or constraints. However, a major research direction within the field of heuristic search is that of finding optimal solutions.
While the A* algorithm was proved to be optimally effective there exists a large number of algorithms and research directions that enhance the A* family of algorithms and improve their performance. In this talk I'll cover a number of such recent algorithms. These algorithms assume a fixed heuristic function but exploit various algorithmic directions to improve upon A* in many ways along the following lines: better memory usage, improved generations of nodes, interleaving depth-first searches into A*, enhanced calculations of the heuristic and recent developments of optimal bidirectional search.
Biography: Ariel Felner received his Ph.D in 2002 from Bar-Ilan University, Israel, and is now an associate professor at Ben-Gurion University, Israel. He is the chair of the Israeli Association for Artificial intelligence (IAAI) and a council member of SoCS. He is interested in all aspects of heuristic search and has performed research in various areas within the field of heuristic search. He pays specific attention to pedagogical and historical aspects of teaching concepts in this field.
Host: Sven Koenig
Location: Hedco Neurosciences Building (HNB) - 15
Audiences: Everyone Is Invited
Contact: Assistant to CS chair