Jump to content

Wheeler Ruml

The neutral encyclopedia of notable people
Wheeler Ruml
OccupationComputer scientist
EducationPh.D., Computer Science, Harvard University (2002)
Alma materHarvard University

Wheeler Ruml is a computer scientist at the University of New Hampshire, where he is a member of the Department of Computer Science.[1] His research concerns heuristic search algorithms, including work on multi-agent path finding and real-time search.[2]

Education

Ruml received his Ph.D. from the Department of Computer Science at Harvard University in 2002.[3]

Career

From 2002 to 2007, Ruml worked as an Area Manager at the Palo Alto Research Center.[4] He joined the Department of Computer Science at the University of New Hampshire in 2007.[5]

Research

According to Semantic Scholar, Ruml has published 185 papers that have been cited a total of 6,310 times, giving him an h-index of 31.[6] His most cited work, "EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding," published at the AAAI Conference on Artificial Intelligence in 2020, has been cited 290 times.[7]

Ruml has received five grants from the National Science Foundation totaling $1,541,987.[8] These include a CAREER award for "Time-Aware Heuristic Search" ($504,563, awarded January 18, 2012), an NSF-BSF collaborative award for "Planning and Acting While Time Passes" ($513,107, awarded August 13, 2020), and "RI-Small: Combinatorial Search Algorithms as Rational Agents" ($478,700, awarded August 9, 2008), all held at the University of New Hampshire.[9] He also received NSF funding to support "A Symposium on Combinatorial Search" ($30,971, awarded July 6, 2009) and "A Symposium Series on Heuristic Search and Its Applications" ($14,646, awarded May 2, 2008).[10]

Selected publications

  • "EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding" (2020), AAAI Conference on Artificial Intelligence[11]
  • "When Does Weighted A* Fail?" (2021), Symposium on Combinatorial Search[12]
  • "SEARCHING" (2017), Shallow Graves[13]
  • "Faster Bounded-Cost Search Using Inadmissible Estimates" (2012), International Conference on Automated Planning and Scheduling[14]
  • "Heuristic Search When Time Matters" (2013), Journal of Artificial Intelligence Research[15]
  • "Anticipatory On-Line Planning" (2012), International Conference on Automated Planning and Scheduling[16]
  • "Avoiding Dead Ends in Real-Time Heuristic Search" (2018), AAAI Conference on Artificial Intelligence[17]
  • "Abstraction-guided Sampling for Motion Planning" (2012)[18]
  • "Speedy Versus Greedy Search" (2014), Symposium on Combinatorial Search[19]
  • "Max is More than Min: Solving Maximization Problems with Heuristic Search" (2014), Symposium on Combinatorial Search[20]
  1. ↑ ORCID iD 0000-0002-1308-2311
  2. ↑ Semantic Scholar publication records for Wheeler Ruml
  3. ↑ ORCID iD 0000-0002-1308-2311
  4. ↑ ORCID iD 0000-0002-1308-2311
  5. ↑ ORCID iD 0000-0002-1308-2311
  6. ↑ Semantic Scholar publication records for Wheeler Ruml
  7. ↑ Semantic Scholar publication records for Wheeler Ruml
  8. ↑ National Science Foundation award records
  9. ↑ National Science Foundation award records
  10. ↑ National Science Foundation award records
  11. ↑ Semantic Scholar publication records for Wheeler Ruml
  12. ↑ Semantic Scholar publication records for Wheeler Ruml
  13. ↑ Semantic Scholar publication records for Wheeler Ruml
  14. ↑ Semantic Scholar publication records for Wheeler Ruml
  15. ↑ Semantic Scholar publication records for Wheeler Ruml
  16. ↑ Semantic Scholar publication records for Wheeler Ruml
  17. ↑ Semantic Scholar publication records for Wheeler Ruml
  18. ↑ Semantic Scholar publication records for Wheeler Ruml
  19. ↑ Semantic Scholar publication records for Wheeler Ruml
  20. ↑ Semantic Scholar publication records for Wheeler Ruml
Retrieved from "https://fullbios.com/index.php?title=Wheeler_Ruml&oldid=64838"