2008 | ||
---|---|---|
88 | Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak: Agent Coordination with Regret Clearing. AAAI 2008: 101-107 | |
87 | EE | Yaxin Liu, Sven Koenig: An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functions. AAMAS (1) 2008: 453-460 |
86 | EE | Xiaoxun Sun, Sven Koenig, William Yeoh: Generalized Adaptive A*. AAMAS (1) 2008: 469-476 |
85 | EE | Xiaoming Zheng, Sven Koenig: Reaction functions for task allocation to cooperative agents. AAMAS (2) 2008: 559-566 |
84 | EE | William Yeoh, Ariel Felner, Sven Koenig: BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. AAMAS (2) 2008: 591-598 |
83 | EE | William Yeoh, Sven Koenig, Xiaoxun Sun: Trading off solution cost for smaller runtime in DCOP search algorithms. AAMAS (3) 2008: 1445-1448 |
82 | John Paul Kelly, Adi Botea, Sven Koenig: Offline Planning with Hierarchical Task Networks in Video Games. AIIDE 2008 | |
2007 | ||
81 | Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig: Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012 | |
80 | Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner: Theta*: Any-Angle Path Planning on Grids. AAAI 2007: 1177-1183 | |
79 | EE | Sven Koenig, Maxim Likhachev, Xiaoxun Sun: Speeding up moving-target search. AAMAS 2007: 188 |
78 | EE | Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur: Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. IJCAI 2007: 1359-1365 |
77 | EE | Xiaoxun Sun, Sven Koenig: The Fringe-Saving A* Search Algorithm - A Feasibility Study. IJCAI 2007: 2391-2397 |
76 | EE | Janusz Marecki, Sven Koenig, Milind Tambe: A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources. IJCAI 2007: 2536-2541 |
75 | EE | Justin Melvin, Pinar Keskinocak, Sven Koenig, Craig A. Tovey, Banu Yuksel Ozkaya: Multi-robot routing with rewards and disjoint time windows. IROS 2007: 2332-2337 |
74 | EE | Xiaoming Zheng, Sven Koenig: Robot coverage of terrain with non-uniform traversability. IROS 2007: 3757-3764 |
2006 | ||
73 | Yaxin Liu, Sven Koenig: Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions. AAAI 2006 | |
72 | Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain: The Power of Sequential Single-Item Auctions for Agent Coordination. AAAI 2006 | |
71 | EE | Sven Koenig, Maxim Likhachev: Real-time adaptive A*. AAMAS 2006: 281-288 |
70 | Maxim Likhachev, Sven Koenig: Incremental Heuristic Search in Games: The Quest for Speed. AIIDE 2006: 118-120 | |
69 | Sven Koenig, Maxim Likhachev: A New Principle for Incremental Heuristic Search: Theoretical Results. ICAPS 2006: 402-405 | |
68 | Yaxin Liu, Sven Koenig: Probabilistic Planning with Nonlinear Utility Functions. ICAPS 2006: 410-413 | |
67 | EE | Xiaoming Zheng, Sven Koenig, Craig A. Tovey: Improving Sequential Single-Item Auctions. IROS 2006: 2238-2244 |
66 | EE | Sven Koenig, Apurva Mudgal, Craig A. Tovey: A near-tight approximation lower bound and algorithm for the kidnapped robot problem. SODA 2006: 133-142 |
65 | Sven Koenig, Sarit Kraus, Munindar P. Singh, Michael Wooldridge: Report on the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems. AI Magazine 27(1): 103-107 (2006) | |
2005 | ||
64 | Frank Dignum, Virginia Dignum, Sven Koenig, Sarit Kraus, Munindar P. Singh, Michael Wooldridge: 4rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands ACM 2005 | |
63 | Yaxin Liu, Sven Koenig: Risk-Sensitive Planning with One-Switch Utility Functions: Value Iteration. AAAI 2005: 993-999 | |
62 | EE | Syed Muhammad Ali, Sven Koenig, Milind Tambe: Preprocessing techniques for accelerating the DCOP algorithm ADOPT. AAMAS 2005: 1041-1048 |
61 | EE | Sven Koenig, Maxim Likhachev: Adaptive A. AAMAS 2005: 1311-1312 |
60 | Maxim Likhachev, Sven Koenig: A Generalized Framework for Lifelong Planning A* Search. ICAPS 2005: 99-108 | |
59 | EE | David Furcy, Sven Koenig: Limited Discrepancy Beam Search. IJCAI 2005: 125-131 |
58 | EE | David Furcy, Sven Koenig: Scaling up WA* with Commitment and Diversity. IJCAI 2005: 1521-1522 |
57 | EE | Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain: Auction-Based Multi-Robot Routing. Robotics: Science and Systems 2005: 343-350 |
56 | EE | Yaxin Liu, Sven Koenig: Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures. UAI 2005: 354-363 |
55 | EE | Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig: Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. SIAM J. Discrete Math. 19(2): 431-447 (2005) |
2004 | ||
54 | Shlomo Zilberstein, Jana Koehler, Sven Koenig: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), June 3-7 2004, Whistler, British Columbia, Canada AAAI 2004 | |
53 | EE | Sven Koenig: A Comparison of Fast Search Methods for Real-Time Situated Agents. AAMAS 2004: 864-871 |
52 | EE | Apurva Mudgal, Craig A. Tovey, Sven Koenig: Analysis of Greedy Robot-Navigation Methods. AMAI 2004 |
51 | EE | Syed Muhammad Ali, Sven Koenig, Milind Tambe: Preprocessing Techniques for Distributed Constraint Optimization. CP 2004: 706-710 |
50 | Sven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy: Incremental Heuristic Search in AI. AI Magazine 25(2): 99-112 (2004) | |
49 | Shlomo Zilberstein, Jana Koehler, Sven Koenig: The Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04). AI Magazine 25(4): 101-104 (2004) | |
48 | EE | Sven Koenig, Maxim Likhachev, David Furcy: Lifelong Planning A. Artif. Intell. 155(1-2): 93-146 (2004) |
47 | EE | Jonas Svennebring, Sven Koenig: Building Terrain-Covering Ant Robots: A Feasibility Study. Auton. Robots 16(3): 313-332 (2004) |
2003 | ||
46 | EE | Yaxin Liu, Richard Goodwin, Sven Koenig: Risk-averse auction agents. AAMAS 2003: 353-360 |
45 | Craig A. Tovey, Sam Greenberg, Sven Koenig: Improved analysis of D. ICRA 2003: 3371-3378 | |
44 | Jonas Svennebring, Sven Koenig: Trail-Laying Robots for Robust Terrain Coverage. ICRA 2003: 75-82 | |
43 | Sven Koenig, Robert C. Holte: The Fifth Symposium on Abstraction, Reformulation, and Approximation (SARA-2002). AI Magazine 24(1): 99-100 (2003) | |
42 | EE | Sven Koenig, Craig A. Tovey, Yury V. Smirnov: Performance bounds for planning in unknown terrain. Artif. Intell. 147(1-2): 253-279 (2003) |
2002 | ||
41 | Sven Koenig, Robert C. Holte: Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings Springer 2002 | |
40 | Sven Koenig, Maxim Likhachev: D*Lite. AAAI/IAAI 2002: 476-483 | |
39 | Yaxin Liu, Sven Koenig, David Furcy: Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. AAAI/IAAI 2002: 484-491 | |
38 | Sven Koenig, David Furcy, Colin Bauer: Heuristic Search-Based Replanning. AIPS 2002: 294-301 | |
37 | EE | Jonas Svennebring, Sven Koenig: Towards Building Terrain-Covering Ant Robots. Ant Algorithms 2002: 202-215 |
36 | Sven Koenig, Maxim Likhachev: Improved Fast Replanning for Robot Navigation in Unknown Terrain. ICRA 2002: 968-975 | |
35 | EE | Maxim Likhachev, Sven Koenig: Speeding up the Parti-Game Algorithm. NIPS 2002: 1563-1570 |
34 | EE | Sven Koenig, Yaxin Liu: The interaction of representations and planning objectives for decision-theoretic planning tasks. J. Exp. Theor. Artif. Intell. 14(4): 303-326 (2002) |
2001 | ||
33 | EE | Maxim Likhachev, Sven Koenig: Lifelong Planning for Mobile Robots. Advances in Plan-Based Control of Robotic Agents 2001: 140-156 |
32 | EE | Sven Koenig, Yaxin Liu: Terrain coverage with ant robots: a simulation study. Agents 2001: 600-607 |
31 | Amin Atrash, Sven Koenig: Probabilistic Planning for Behavior-Based Robots. FLAIRS Conference 2001: 531-535 | |
30 | Sven Koenig, Craig A. Tovey, William Halliburton: Greedy Mapping of Terrain. ICRA 2001: 3594-3599 | |
29 | EE | Sven Koenig, Maxim Likhachev: Incremental A*. NIPS 2001: 1539-1546 |
28 | Sven Koenig: Agent-Centered Search. AI Magazine 22(4): 109-132 (2001) | |
27 | Sven Koenig, Boleslaw K. Szymanski, Yaxin Liu: Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31(1-4): 41-76 (2001) | |
26 | EE | Sven Koenig: Minimax real-time heuristic search. Artif. Intell. 129(1-2): 165-197 (2001) |
2000 | ||
25 | Craig A. Tovey, Sven Koenig: Gridworlds as Testbeds for Planning with Incomplete Information. AAAI/IAAI 2000: 819-824 | |
24 | David Furcy, Sven Koenig: Speeding up the Convergence of Real-Time Search. AAAI/IAAI 2000: 891-897 | |
23 | Sven Koenig, Yaxin Liu: Representations of Decision-Theoretic Planning Tasks. AIPS 2000: 187-195 | |
22 | EE | Sven Koenig: Planning-Task Transformations for Soft Deadlines. ATAL 2000: 305-319 |
21 | David J. Musliner, Barney Pell, Wolff Dobson, Kai Goebel, Gautam Biswas, Sheila A. McIlraith, Giuseppina C. Gini, Sven Koenig, Shlomo Zilberstein, Weixiong Zhang: Reports on the AAAI Spring Symposia (March 1999). AI Magazine 21(2): 79-84 (2000) | |
20 | Sven Koenig: 'From Animals to Animats 5': Proceedings of the Fifth International Conference on Simulation of Adaptive Behavior. Artificial Life 6(3): 255-258 (2000) | |
1999 | ||
19 | Sven Koenig, Boleslaw K. Szymanski: Value-Update Rules for Real-Time Search. AAAI/IAAI 1999: 718-724 | |
18 | Sven Koenig, Yaxin Liu: Sensor Planning with Non-linear Utility Functions. ECP 1999: 265-277 | |
1998 | ||
17 | Sven Koenig, Reid G. Simmons: Solving Robot Navigation Problems with Initial Pose Uncertainty Using Real-Time Heuristic Search. AIPS 1998: 145-153 | |
16 | EE | Sven Koenig: Exploring Unknown Environments with Real-Time Search or Reinforcement Learning. NIPS 1998: 1003-1009 |
1997 | ||
15 | Reid G. Simmons, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Joseph O'Sullivan: A Layered Architecture for Office Delivery Robots. Agents 1997: 245-252 | |
14 | EE | Reid G. Simmons, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Joseph O'Sullivan, Manuela M. Veloso: Xavier: experience with a layered robot architecture. SIGART Bulletin 8(1-4): 22-33 (1997) |
1996 | ||
13 | Sven Koenig, Reid G. Simmons: Easy and Hard Testbeds for Real-Time Search Algorithms. AAAI/IAAI, Vol. 1 1996: 279-285 | |
12 | Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, Reid G. Simmons: Efficient Goal-Directed Exploration. AAAI/IAAI, Vol. 1 1996: 292-297 | |
11 | Reid G. Simmons, Sebastian Thrun, Greg Armstrong, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Shyjan Mahamud, Daniel Nikovski, Joseph O'Sullivan: Amelia. AAAI/IAAI, Vol. 2 1996: 1358 | |
10 | Sven Koenig: Agent-Centered Search: Situated Search with Small Look-Ahead. AAAI/IAAI, Vol. 2 1996: 1365 | |
9 | EE | Sven Koenig, Yury V. Smirnov: Graph Learning with a Nearest Neighbor Approach. COLT 1996: 19-28 |
8 | Sven Koenig, Reid G. Simmons: Passive Distance Learning for Robot Navigation. ICML 1996: 266-274 | |
7 | Sven Koenig, Reid G. Simmons: The Effect of Representation and Knowledge on Goal-Directed Exploration with Reinforcement-Learning Algorithms. Machine Learning 22(1-3): 227-250 (1996) | |
1995 | ||
6 | Reid G. Simmons, Sven Koenig: Probabilistic Robot Navigation in Partially Observable Environments. IJCAI 1995: 1080-1087 | |
5 | Sven Koenig, Reid G. Simmons: Real-Time Search in Non-Deterministic Domains. IJCAI 1995: 1660-1669 | |
4 | Sven Koenig, Richard Goodwin, Reid G. Simmons: Robot Navigation with Markov Models: A Framework for Path Planning and Learning with Limited Computational Resources. Reasoning with Uncertainty in Robotics 1995: 322-337 | |
1994 | ||
3 | Sven Koenig, Reid G. Simmons: How to Make Probabilistic Planners Risk-sensitive (Without Altering Anything). AIPS 1994: 293-298 | |
2 | Sven Koenig, Reid G. Simmons: Risk-Sensitive Planning with Probabilistic Decision Graphs. KR 1994: 363-373 | |
1993 | ||
1 | Sven Koenig, Reid G. Simmons: Complexity Analysis of Real-Time Reinforcement Learning. AAAI 1993: 99-107 |