Xiaoming Zheng (Graduate Student)
Xiaoming received a B.E. in Computer Science from the University of Science
and Technology of China in 2004, an M.S in Computer Science from USC in 2007
and an M.A. in Economics from USC in 2008. Xiaoming is interested in
coordinating agents with market mechanisms. Market mechanisms, such as
auctions and negotiations, are decentralized approaches and appear to perform
well in many situations. Auctions, for example, are efficient in terms of both
the required amount of computation and communication (since information is
compressed into numeric bids that the agents can compute in parallel) and can
result in near-optimal task allocations. Market-based coordination algorithms
could be applied in robotics, for example for planetary exploration or search
and rescue. His research centers on exploring the trade-off between
the computation/communication effort and the resulting team performance and on
extending the functionality of market-based coordination algorithms. More
information can be found on his homepage.
- X. Zheng and S. Koenig. Generalized Reaction Functions for Solving Complex-Task Allocation Problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 478-483, 2011. [downloadable]
- X. Zheng, S. Koenig, D. Kempe and S. Jain. Multi-Robot Forest Coverage for Weighted and Unweighted Terrain. IEEE Transactions on Robotics, 26, (6), 1018-1031, 2010. [downloadable]
- X. Zheng and S. Koenig. Sequential Incremental-Value Auctions. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2010. [downloadable]
- X. Zheng and S. Koenig. Market-Based Algorithms for Allocating Complex Tasks [Student Abstract]. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2010. [downloadable]
- T. Neller, J. DeNero, D. Klein, S. Koenig, W. Yeoh, X. Zheng, K. Daniel, A. Nash, Z. Dodds, G. Carenini, D. Poole and C. Brooks. Model AI Assignments. In Proceedings of the Symposium on Educational Advances in Artificial Intelligence (EAAI), 2010. [downloadable]
- X. Zheng and S. Koenig. A Project on Gesture Recognition with Neural Networks for 'Introduction to Artificial Intelligence' Classes. Technical Report, Department of Computer Science, University of Southern California, Los Angeles (California), 2010. [downloadable]
- X. Zheng and S. Koenig. K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 373-379, 2009. [downloadable]
- X. Zheng and S. Koenig. Negotiation with Reaction Functions for Solving Complex Task Allocation Problems. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 4811-4816, 2009. [downloadable]
- S. Koenig, X. Zheng, C. Tovey, R. Borie, P. Kilby, V. Markakis and P. Keskinocak. Agent Coordination with Regret Clearing. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 101-107, 2008. [downloadable]
- X. Zheng and S. Koenig. Reaction Functions for Task Allocation to Cooperative Agents. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 559-566, 2008. [downloadable]
- X. Zheng and S. Koenig. Greedy Approaches for Solving Task-Allocation Problems with Coalitions. In Proceedings of the AAMAS-08 Workshop on Formal Models and Methods for Multi-Robot Systems, 35-40, 2008. [downloadable]
- S. Koenig, C. Tovey, X. Zheng and I. Sungur. Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1359-1365, 2007. [downloadable]
- X. Zheng and S. Koenig. Robot Coverage of Terrain with Non-Uniform Traversability. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 3757-3764, 2007. [downloadable]
- X. Zheng, S. Koenig and C. Tovey. Improving Sequential Single-Item Auctions. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2238-2244, 2006. [downloadable]
- X. Zheng, S. Jain, S. Koenig and D. Kempe. Multi-Robot Forest Coverage. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2318-2323, 2005. [downloadable]
Current Visitors
Giuseppe Caggianese
Giuseppe received a second-level degree in Computer Science in 2010 with a
thesis on "A GPU Implementation of Path-Finding Algorithms for Massive Numbers
of Agents in Dynamic Environments." Giuseppe is now a Ph.D. student in Methods
and Technologies for Environmental Monitoring at the Department of
Environmental Engineering and Physics, University of Basilicata (Italy).
Giuseppe is interested in parallel programming with the CUDA architecture and
general-purpose computing on GPUs, behavioral models for mobile agents,
multi-agent path finding, real-time computer animation, motion planning with
heuristic search, robot simulations, and sensors and sensing technologies for
environmental applications.
Former Students
Kenny Daniel (Former Graduate Student)
Kenny
received a B.S. in Computer Science and a B.S. in Mathematics from Carnegie
Mellon University in 2006 and subsequently a Master's degree from USC. He
placed 6th in the ACM Southern California Regional Programming Contest (out of
63 teams) in 2007, 1st in the USC Programming Contest (out of 31 students) in
2007, 2nd in the ACM Southern California Regional Programming Contest (out of
73 teams) in 2006, and 2nd in the USC Programming Contest (out of 49 students)
in 2006.
Last seen: Cofounder of Algorithmia, Inc.
- K. Daniel, A. Nash, S. Koenig and A. Felner. Theta*: Any-Angle Path Planning on Grids. Journal of Artificial Intelligence Research, 39, 533-579, 2010. [downloadable]
- K. Daniel, R. Borie, S. Koenig and C. Tovey. ESP: Pursuit Evasion on Series-Parallel Graphs [Poster Abstract]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2010. [downloadable]
- T. Neller, J. DeNero, D. Klein, S. Koenig, W. Yeoh, X. Zheng, K. Daniel, A. Nash, Z. Dodds, G. Carenini, D. Poole and C. Brooks. Model AI Assignments. In Proceedings of the Symposium on Educational Advances in Artificial Intelligence (EAAI), 2010. [downloadable]
- K. Daniel and S. Koenig. Fast Winner Determination for Agent Coordination with SBB Auctions [Short Paper]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1197-1198, 2009. [downloadable]
- R. Borie, C. Tovey, K. Daniel and S. Koenig. ESP: Pursuit Evasion on Series-Parallel Graphs. Technical Report, Department of Computer Science, University of Southern California, Los Angeles (California), 2009. [downloadable]
- S. Koenig, K. Daniel and A. Nash. A Project on Any-Angle Path Planning for Computer Games for 'Introduction to Artificial Intelligence' Classes. Technical Report, Department of Computer Science, University of Southern California, Los Angeles (California), 2008. [downloadable]
- A. Nash, K. Daniel, S. Koenig and A. Felner. Theta*: Any-Angle Path Planning on Grids. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 1177-1183, 2007. [downloadable]
Dr. David Furcy (Former Graduate Student)
David
Furcy received a B.S. in Computer Engineering from the Universite de
Technologie de Compiegne (France) in 1993, an M.S. in Computer Science from
the Universite de Technologie de Compiegne (France) in 1994, an M.S. in
Computer Science from the University of Iowa in 1997, and a Ph.D. in Computer
Science from Georgia Institute of Technology in 2004 for his dissertation
"Speeding up the Convergence of Online Heuristic Search and Scaling up Offline
Heuristic Search." He was nominated for the ICAPS 2004 Best Paper Award. More
information can be found on his homepage.
Previously seen: Interim Professor at Blackburn College
Last seen: Associate Professor at the University of Wisconsin Oshkosh
- D. Furcy and S. Koenig. Limited Discrepancy Beam Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 125-131, 2005. [downloadable]
- D. Furcy and S. Koenig. Scaling up WA* with Commitment and Diversity [Poster Abstract]. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1521-1522, 2005. [downloadable]
- S. Koenig, M. Likhachev and D. Furcy. Lifelong Planning A*. Artificial Intelligence Journal, 155, (1-2), 93-146, 2004. [downloadable]
- S. Koenig, M. Likhachev, Y. Liu and D. Furcy. Incremental Heuristic Search in Artificial Intelligence. Artificial Intelligence Magazine, 25, (2), 99-112, 2004. [downloadable]
- Y. Liu, S. Koenig and D. Furcy. Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 484-491, 2002. [downloadable]
- S. Koenig, D. Furcy and C. Bauer. Heuristic Search-Based Replanning. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS), 294-301, 2002. [downloadable]
- D. Furcy and S. Koenig. Speeding up the Convergence of Real-Time Search. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 891-897, 2000. [downloadable]
- D. Furcy and S. Koenig. Speeding up the Convergence of Real-Time Search: Empirical Setup and Proofs. Technical Report, College of Computing, Georgia Institute of Technology, Atlanta (Georgia), 2000. [downloadable]
Dr. Yaxin Liu (Former Graduate Student)
Yaxin
Liu received a B.S. in Computer Science from Peking University in 1994, an
M.S. in Computer Science from Peking University in 1997, and a Ph.D. in
Computer Science from Georgia Institute of Technology in 2005 for his
dissertation "Decision-Theoretic Planning Under Risk-Sensitive Planning
Objectives." He won IBM Fellowship Awards in 2002 and 2003, the Outstanding
Graduate Research Assistant Award from the College of Computing at Georgia
Institute of Technology in 2002, and the Outstanding Dissertation Award from
the College of Computing at Georgia Institute of Technology in 2007.
Previously seen: Research Scientist at the University of Texas at Austin
Previously seen: Lead Scientist at Isaac
Last seen: Software Engineer at Google
- Y. Liu and S. Koenig. An Exact Algorithm for Solving MDPs under Risk-Sensitve Planning Objectives with One-Switch Utility Functions. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 453-460, 2008. [downloadable]
- Y. Liu and S. Koenig. Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 1186-1193, 2006. [downloadable]
- Y. Liu and S. Koenig. Risk-Sensitive Planning with One-Switch Utility Functions: Value Iteration. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 993-999, 2005. [downloadable]
- Y. Liu and S. Koenig. Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence (UAI), 354-363, 2005. [downloadable]
- S. Koenig, M. Likhachev, Y. Liu and D. Furcy. Incremental Heuristic Search in Artificial Intelligence. Artificial Intelligence Magazine, 25, (2), 99-112, 2004. [downloadable]
- S. Koenig and Y. Liu. The Interaction of Representations and Planning Objectives for Decision-Theoretic Planning Tasks. Journal of Experimental and Theoretical Artificial Intelligence, 14, 303-326, 2002. [downloadable]
- Y. Liu, S. Koenig and D. Furcy. Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 484-491, 2002. [downloadable]
- S. Koenig, B. Szymanski and Y. Liu. Efficient and Inefficient Ant Coverage Methods. Annals of Mathematics and Artificial Intelligence - Special Issue on Ant Robotics, 31, 41-76, 2001. [downloadable]
- S. Koenig and Y. Liu. Terrain Coverage with Ant Robots: A Simulation Study. In Proceedings of the International Conference on Autonomous Agents (AGENTS), 600-607, 2001. [downloadable]
- S. Koenig and Y. Liu. Representations of Decision-Theoretic Planning Tasks. In Proceedings of the International Conference on Artificial Intelligence Planning Systems (AIPS), 187-195, 2000. [downloadable]
- S. Koenig and Y. Liu. Sensor Planning with Non-Linear Utility Functions. In Proceedings of the European Conference on Planning (ECP), 265-277, Springer, 1999. [downloadable]
Dr. Xiaoxun Sun (Former Graduate Student)
Xiaoxun
received a B.E. in Computer Science from Beijing University of Aeronautics and
Astronautics in 2003, an M.S. (with honors) in Media and Knowledge Engineering
from Delft University of Technology in 2005, an M.S. in Computer Science from
USC in 2008, and a Ph.D. in Computer Science from USC in 2013 for his
dissertation "Incremental Search-Based Path-Planning for Moving Target
Search." He received the USC Annenberg Graduate Fellowship in 2007. More
information can be found on his homepage.
Last seen: Software Engineer at Google
- X. Sun, T. Uras, S. Koenig and W. Yeoh. Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2012. [downloadable]
- C. Hernandez, X. Sun, S. Koenig and P. Meseguer. Tree Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 123-130, 2011. [downloadable]
- W. Yeoh, P. Varakantham, X. Sun and S. Koenig. Incremental DCOP Search Algorithms for Solving Dynamic DCOPs [Extended Abstract]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 169-170, 2011. [downloadable]
- X. Sun, W. Yeoh and S. Koenig. Generalized Fringe-Retrieving A*: Faster Moving Target Search on State Lattices. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1081-1088, 2010. [downloadable]
- X. Sun, W. Yeoh and S. Koenig. Moving Target D* Lite. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 67-74, 2010. [downloadable]
- S. Koenig and X. Sun. Comparing Real-Time and Incremental Heuristic Search for Real-Time Situated Agents. Journal of Autonomous Agents and Multi-Agent Systems, 18, (3), 313-341, 2009. [downloadable]
- X. Sun, W. Yeoh and S. Koenig. Efficient Incremental Search for Moving Target Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 615-620, 2009. [downloadable]
- W. Yeoh, X. Sun and S. Koenig. Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 354-360, 2009. [downloadable]
- X. Sun, W. Yeoh, P. Chen and S. Koenig. Simple Optimization Techniques for A*-Based Search. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 931-936, 2009. [downloadable]
- C. Hernandez, P. Meseguer, X. Sun and S. Koenig. Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 358-361, 2009. [downloadable]
- X. Sun, S. Koenig and W. Yeoh. Generalized Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 469-476, 2008. [downloadable]
- W. Yeoh, S. Koenig and X. Sun. Trading Off Solution Cost for Smaller Runtime in DCOP Search Algorithms [Short Paper]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1445-1448, 2008.
- W. Yeoh, S. Koenig and X. Sun. Trading Off Solution Cost for Smaller Runtime in DCOP Search Algorithms (Extended Version). In Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR), 25-35, 2008.
- X. Sun and S. Koenig. The Fringe-Saving A* Search Algorithm - A Feasibility Study. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2391-2397, 2007. [downloadable]
- S. Koenig, M. Likhachev and X. Sun. Speeding up Moving-Target Search. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2007. [downloadable]
Dr. William Yeoh (Former Graduate Student)
William
received a B.S.E. (Magna cum Laude) and M.S. in Mechanical Engineering and
Applied Mechanics from the University in Pennsylvania in 2004, an M.S. in
Computer Science from USC in 2007, and a Ph.D. in Computer Science from USC in
2010 for his dissertation "Speeding up Distributed Constraint Optimization
Search Algorithms." He was nominated for the AAMAS 2009 Pragnesh Jay Modi Best
Student Paper Award and is a member of both Phi Kappa Phi and Pi Tau Sigma. He
won an Outstanding Teaching Assistant Award from the Computer Science
Department at USC in both 2004 and 2007 and was nominated for the University
Outstanding Teaching Award at USC in 2009. He also won an Outstanding Research
Assistant Award from the Computer Science Department at USC in 2009. More
information can be found on his homepage.
Previously seen: Postdoctoral Researcher at the University of Massachusetts at Amherst
Previously seen: Research Scientist at Singapore Management University
Last seen: Assistant Professor at New Mexico State University
- X. Sun, T. Uras, S. Koenig and W. Yeoh. Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2012. [downloadable]
- W. Yeoh, P. Varakantham, X. Sun and S. Koenig. Incremental DCOP Search Algorithms for Solving Dynamic DCOPs [Extended Abstract]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 169-170, 2011. [downloadable]
- W. Yeoh, A. Felner and S. Koenig. BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Alorithm. Journal of Artificial Intelligence Research, 38, 85-133, 2010. [downloadable]
- T. Neller, J. DeNero, D. Klein, S. Koenig, W. Yeoh, X. Zheng, K. Daniel, A. Nash, Z. Dodds, G. Carenini, D. Poole and C. Brooks. Model AI Assignments. In Proceedings of the Symposium on Educational Advances in Artificial Intelligence (EAAI), 2010. [downloadable]
- X. Sun, W. Yeoh and S. Koenig. Efficient Incremental Search for Moving Target Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 615-620, 2009. [downloadable]
- W. Yeoh, X. Sun and S. Koenig. Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 354-360, 2009. [downloadable]
- X. Sun, W. Yeoh, P. Chen and S. Koenig. Simple Optimization Techniques for A*-Based Search. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 931-936, 2009. [downloadable]
- W. Yeoh, P. Varakantham and S. Koenig. Caching Schemes for DCOP Search Algorithms. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 609-616, 2009. [downloadable]
- W. Yeoh, R. Zivan and S. Koenig. Discrepancy-Based Approach for Solving Distributed Constraint Optimization Problems. In Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR), 132-144, 2009. [downloadable]
- W. Yeoh, A. Felner and S. Koenig. BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 591-598, 2008. [downloadable]
- X. Sun, S. Koenig and W. Yeoh. Generalized Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 469-476, 2008. [downloadable]
- W. Yeoh, S. Koenig and X. Sun. Trading Off Solution Cost for Smaller Runtime in DCOP Search Algorithms [Short Paper]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1445-1448, 2008.
- W. Yeoh, S. Koenig and X. Sun. Trading Off Solution Cost for Smaller Runtime in DCOP Search Algorithms (Extended Version). In Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR), 25-35, 2008.
- S. Koenig and W. Yeoh. A Project on Fast Trajectory Replanning for Computer Games for 'Introduction to Artificial Intelligence' Classes. Technical Report, Department of Computer Science, University of Southern California, Los Angeles (California), 2008. [downloadable]
- W. Yeoh, S. Koenig and A. Felner. IDB-ADOPT: A Depth-First Search DCOP Algorithm. In Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR), 60-70, 2007. [downloadable]
- W. Yeoh, A. Felner and S. Koenig. BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. In Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR), 2007. [downloadable]
Former Visitors
Dr. Carlos Hernández
Carlos Hernández is an Associate Professor at the Universidad
Católica de la Ssma. Concepción (Chile). He received a B.S. in
Computer Engineering from the Universidad de Concepción (Chile) in 1996
and a Ph.D. in Computer Science from Universidad Autónoma de Barcelona
(Spain) in 2008 for his dissertation "Bounded Propagation in Real-Time
Heuristic Search." Carlos is currently interested in heuristic search,
automated planning, real-time heuristic search, incremental heuristic search,
path planning, multi-agent systems and sensor networks, among other
topics. Carlos visitied our lab three times, namely for 3.5 months in 2009, 1
month in 2010 and 8 months in 2011/2012.
- T. Uras, S. Koenig and C. Hernandez. Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2013. [downloadable]
- C. Hernandez, J. Baier, T. Uras and S. Koenig. Time-Bounded Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 997-1006, 2012. [downloadable]
- T. Uras, S. Koenig and C. Hernandez. Subgoal Graphs for Eight-Neighbor Gridworlds. In Proceedings of the Symposium on Combinatorial Search, 2012. [downloadable]
- C. Hernandez, J. Baier, T. Uras and S. Koenig. Position Paper: Incremental Search Algorithms Considered Poorly Understood. In Proceedings of the Symposium on Combinatorial Search, 2012. [downloadable]
- C. Hernandez, J. Baier, T. Uras and S. Koenig. Demonstration Abstract: New Developments in Real-Time Heuristic Search: A Demo. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2012. [downloadable]
- C. Hernandez, J. Baier, T. Uras and S. Koenig. Paper Summary: Time-Bounded Adaptive A*. In Proceedings of the Symposium on Combinatorial Search, 2012. [downloadable]
- C. Hernandez, X. Sun, S. Koenig and P. Meseguer. Tree Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 123-130, 2011. [downloadable]
- C. Hernandez, P. Meseguer, X. Sun and S. Koenig. Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 358-361, 2009. [downloadable]
Many publishers do not want authors to make their papers available
electronically after the papers have been published. Please use the
electronic versions provided here only if hardcopies are not yet
available. If you have comments on any of these papers, please send me an
email! Also, please send me your papers if we have common interests.
research group celebrating a productive year
This page was automatically created by a bibliography maintenance system that
was developed as part of an undergraduate research project, advised by Sven Koenig.
Home Page of Sven Koenig
Liron
received a B.S. in Computer Engineering in 2007 and an M.S. in Computer
Science in 2012, both from the Hebrew University of Jerusalem. Liron is
interested in combinatorial problems related to constraint-based reasoning and
symbolic planning. Specifically, he is looking at novel algorithmic techniques
for exploiting structure in such combinatorial problems. 
Tansel
received a B.S. in Computer Science (with a minor in Mathematics) in 2009 and
an M.S. in Computer Science in 2011 from Sabanci University. Tansel is
currently interested in incremental heuristic search, path planning and game
theory, among other topics. He developed a novel optimal path-planning approach
(based on subgoal graphs) that remained non-dominated in the grid-based path
planning competition in 2012.
Marcello received an M.S. in Computer Science Engineering in 2005 from
Politecnico di Milano and a Ph.D. in Computer Science from the University of
Örebro for his dissertation "Planning in Inhabited Environments:
Human-Aware Task Planning and Activity Recognition". Marcello's main research
interests are automated planning, graph search algorithms and their
application to real-world domains. His research currently focuses on motion
planning for non-holonomic vehicles and multi-robot coordination. 
Alex
received a B.S. in Computer Science from Yale University in 2004, an M.S. in
Computer Science from USC in 2006 and a Ph.D. in Computer Science from USC in
2012 for his dissertation "Any-Angle Path Planning." Since 2005 he has been
working full time doing mission planning research and development for the
Northrop Grumman Corporation where his IR&D team has received two Gold
Awards. 
Daniel
received a B.S in Computer Engineering/Computer Science from USC in 2009 and
then entered the Ph.D. program in Electrical Engineering at USC as a recipient
of the USC Provost Graduate Fellowship. He was a recipient of the Rose Hills
Foundation Science and Engineering Fellowship in 2009 and the Rose Hills
Foundation Scholarship. He is a member of Tau Beta Pi and Eta Kappa Nu. 
Ariel
Felner is an Associate Professor at Ben Gurion University (Israel). He
received a B.S. with distinction from Hebrew University in Jerusalem in 1993,
an M.S. from the same university in 1995, and a Ph.D. in Computer Science from
Bar-Ilan University (Israel) in 2002 for his dissertation "Improving Search
Techniques and Using them in Different Environments." Ariel is currently
interested in heuristic search. Ariel visited our lab for 6 months in 2006/2007.