Trevor Scott Standley
Cell number: (310) 963-8657
I am interested in artificial intelligence (machine learning, heuristic search, and reasoning). One of my long term goals is to help make artificial intelligence more general. I am also interested in computer graphics and CS theory.
I received my BS in Electrical Engineering and Computer Sciences with honors from UC Berkeley in 2008. I received my MS in Computer Science from UCLA in 2010 and was the department's Outstanding Masters Graduate. From summer 2010 to the present, I've been working at Google.
Publications (Google Scholar):
Trevor Standley and Richard Korf. Complete Algorithms for Cooperative Pathfinding Problems. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, July 16-22, 2011, pages 668-673. (pdf) (talk)
Trevor Standley. Finding Optimal Solutions to Cooperative Pathfinding Problems. In proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), Atlanta, Georga, July 2010, pages 173-178. (pdf) (talk - ppt)
Arthur Choi, Trevor Standley and Adnan Darwiche. Approximating Weighted Max-SAT Problems by Compensating for Relaxations. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP-09), Lisbon, Portugal, September 20-24, 2009, pages 211-225. (pdf)
Trevor Standley. Independence Detection for Multi-Agent Pathfinding Problems In Workshops at the Twenty-Sixth AAAI Conference on Artificial Intelligence (WoMP), Toronto, Ontario, Canada July 22, 2012. (pdf)
Trevor Standley. Optimal and Anytime Approximation Algorithms for Cooperative Pathfinding Problems. MS Thesis. University of California, Los Angeles, 2010. (pdf)
This website was last updated 12/28/2014.