Sven Koenig - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Generalized Reaction Functions for Solving Complex-Task Allocation ProblemsXiaoming Zheng, Sven Koenig. IJCAI 2011: 478-483 [doi]

2010

Theta*: Any-Angle Path Planning on GridsKenny Daniel, Alex Nash, Sven Koenig, Ariel Felner. jair, 39:533-579, 2010. [doi]

ESP: pursuit evasion on series-parallel graphsKenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey. atal 2010: 1519-1520 [doi]

Progress on Agent Coordination with Cooperative AuctionsSven Koenig, Pinar Keskinocak, Craig A. Tovey. AAAI 2010: [doi]

Open Problem: Analyzing Ant Robot CoverageSven Koenig. colt 2010: 312-313

Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3DAlex Nash, Sven Koenig, Craig A. Tovey. socs 2010: [doi]

Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3DAlex Nash, Sven Koenig, Craig A. Tovey. AAAI 2010: [doi]

Moving target D* LiteXiaoxun Sun, William Yeoh, Sven Koenig. atal 2010: 67-74 [doi]

Generalized Fringe-Retrieving A*: faster moving target search on state latticesXiaoxun Sun, William Yeoh, Sven Koenig. atal 2010: 1081-1088 [doi]

Localization: Approximation and Performance Bounds to Minimize Travel DistanceCraig A. Tovey, Sven Koenig. trob, 26(2):320-330, 2010. [doi]

BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP AlgorithmWilliam Yeoh, Ariel Felner, Sven Koenig. jair, 38:85-133, 2010. [doi]

Multirobot Forest Coverage for Weighted and Unweighted TerrainXiaoming Zheng, Sven Koenig, David Kempe, Sonal Jain. trob, 26(6):1018-1031, 2010. [doi]

Sequential Incremental-Value AuctionsXiaoming Zheng, Sven Koenig. AAAI 2010: [doi]

2009

Algorithms and Complexity Results for Pursuit-Evasion ProblemsRichard B. Borie, Craig A. Tovey, Sven Koenig. IJCAI 2009: 59-66 [doi]

Fast winner determination for agent coordination with SBB auctionsKenny Daniel, Sven Koenig. atal 2009: 1197-1198 [doi]

Multi-robot routing with linear decreasing rewards over timeAli Ekici, Pinar Keskinocak, Sven Koenig. icra 2009: 958-963 [doi]

Path-Adaptive A* for Incremental Heuristic Search in Unknown TerrainCarlos HernÃ¡ndez, Pedro Meseguer, Xiaoxun Sun, Sven Koenig. aips 2009:

A Near-Tight Approximation Algorithm for the Robot Localization ProblemSven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey. siamcomp, 39(2):461-490, 2009. [doi]

Comparing real-time and incremental heuristic search for real-time situated agentsSven Koenig, Xiaoxun Sun. AAMAS, 18(3):313-341, 2009. [doi]

Incremental Phi*: Incremental Any-Angle Path Planning on GridsAlex Nash, Sven Koenig, Maxim Likhachev. IJCAI 2009: 1824-1830 [doi]

Dynamic fringe-saving A*Xiaoxun Sun, William Yeoh, Sven Koenig. atal 2009: 891-898 [doi]

Efficient Incremental Search for Moving Target SearchXiaoxun Sun, William Yeoh, Sven Koenig. IJCAI 2009: 615-620 [doi]

Simple optimization techniques for A*-based searchXiaoxun Sun, William Yeoh, Po-An Chen, Sven Koenig. atal 2009: 931-936 [doi]

Trading Off Solution Quality for Faster Computation in DCOP Search AlgorithmsWilliam Yeoh, Xiaoxun Sun, Sven Koenig. IJCAI 2009: 354-360 [doi]

Caching schemes for DCOP search algorithmsWilliam Yeoh, Pradeep Varakantham, Sven Koenig. atal 2009: 609-616 [doi]

Negotiation with reaction functions for solving complex task allocation problemsXiaoming Zheng, Sven Koenig. iros 2009: 4811-4816 [doi]

K-Swaps: Cooperative Negotiation for Solving Task-Allocation ProblemsXiaoming Zheng, Sven Koenig. IJCAI 2009: 373-379 [doi]

2008

Offline Planning with Hierarchical Task Networks in Video GamesJohn Paul Kelly, Adi Botea, Sven Koenig. aiide 2008:

Agent Coordination with Regret ClearingSven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak. AAAI 2008: 101-107

An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functionsYaxin Liu, Sven Koenig. atal 2008: 453-460 [doi]

Generalized Adaptive A*Xiaoxun Sun, Sven Koenig, William Yeoh. atal 2008: 469-476 [doi]

BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithmWilliam Yeoh, Ariel Felner, Sven Koenig. atal 2008: 591-598 [doi]

Trading off solution cost for smaller runtime in DCOP search algorithmsWilliam Yeoh, Sven Koenig, Xiaoxun Sun. atal 2008: 1445-1448 [doi]

IDB-ADOPT: A Depth-First Search DCOP AlgorithmWilliam Yeoh, Ariel Felner, Sven Koenig. csclp 2009: 132-146 [doi]

Reaction functions for task allocation to cooperative agentsXiaoming Zheng, Sven Koenig. atal 2008: 559-566 [doi]

2007

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal PlanningPatrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig. AAAI 2007: 1007-1012

Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized ControlSven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur. IJCAI 2007: 1359-1365 [doi]

Speeding up moving-target searchSven Koenig, Maxim Likhachev, Xiaoxun Sun. atal 2007: 188 [doi]

A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued ResourcesJanusz Marecki, Sven Koenig, Milind Tambe. IJCAI 2007: 2536-2541 [doi]

Multi-robot routing with rewards and disjoint time windowsJustin Melvin, Pinar Keskinocak, Sven Koenig, Craig A. Tovey, Banu Yuksel Ozkaya. iros 2007: 2332-2337 [doi]

Theta*: Any-Angle Path Planning on GridsAlex Nash, Kenny Daniel, Sven Koenig, Ariel Felner. AAAI 2007: 1177-1183

The Fringe-Saving A* Search Algorithm - A Feasibility StudyXiaoxun Sun, Sven Koenig. IJCAI 2007: 2391-2397 [doi]

Robot coverage of terrain with non-uniform traversabilityXiaoming Zheng, Sven Koenig. iros 2007: 3757-3764 [doi]

2006

Editorial: Special Issue on Robotics: Science and Systems 2005Oliver Brock, Sven Koenig, Nicholas Roy, Gaurav Sukhatme. ijrr, 25(12):1163, 2006.

Report on the Fourth International Joint Conference on Autonomous Agents and Multiagent SystemsSven Koenig, Sarit Kraus, Munindar P. Singh, Michael Wooldridge. aim, 27(1):103-107, 2006.

The Power of Sequential Single-Item Auctions for Agent CoordinationSven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain. AAAI 2006:

A near-tight approximation lower bound and algorithm for the kidnapped robot problemSven Koenig, Apurva Mudgal, Craig A. Tovey. soda 2006: 133-142 [doi]

Real-time adaptive A*Sven Koenig, Maxim Likhachev. atal 2006: 281-288 [doi]

A New Principle for Incremental Heuristic Search: Theoretical ResultsSven Koenig, Maxim Likhachev. aips 2006: 402-405

Incremental Heuristic Search in Games: The Quest for SpeedMaxim Likhachev, Sven Koenig. aiide 2006: 118-120

Probabilistic Planning with Nonlinear Utility FunctionsYaxin Liu, Sven Koenig. aips 2006: 410-413

Functional Value Iteration for Decision-Theoretic Planning with General Utility FunctionsYaxin Liu, Sven Koenig. AAAI 2006:

Improving Sequential Single-Item AuctionsXiaoming Zheng, Sven Koenig, Craig A. Tovey. iros 2006: 2238-2244 [doi]

2005

Preprocessing techniques for accelerating the DCOP algorithm ADOPTSyed Muhammad Ali, Sven Koenig, Milind Tambe. atal 2005: 1041-1048 [doi]

4rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The NetherlandsFrank Dignum, Virginia Dignum, Sven Koenig, Sarit Kraus, Munindar P. Singh, Michael Wooldridge, editors, ACM, 2005.

Scaling up WA* with Commitment and DiversityDavid Furcy, Sven Koenig. IJCAI 2005: 1521-1522 [doi]

Limited Discrepancy Beam SearchDavid Furcy, Sven Koenig. IJCAI 2005: 125-131 [doi]

Adaptive ASven Koenig, Maxim Likhachev. atal 2005: 1311-1312 [doi]

Fast replanning for navigation in unknown terrainSven Koenig, Maxim Likhachev. trob, 21(3):354-363, 2005. [doi]

Auction-Based Multi-Robot RoutingMichail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain. rss 2005: 343-350 [doi]

A Generalized Framework for Lifelong Planning A* SearchMaxim Likhachev, Sven Koenig. aips 2005: 99-108

Risk-Sensitive Planning with One-Switch Utility Functions: Value IterationYaxin Liu, Sven Koenig. AAAI 2005: 993-999

Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and ConjecturesYaxin Liu, Sven Koenig. uai 2005: 354-363 [doi]

Bounds on the Travel Cost of a Mars Rover Prototype Search HeuristicApurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig. siamdm, 19(2):431-447, 2005. [doi]

2004

Preprocessing Techniques for Distributed Constraint OptimizationSyed Muhammad Ali, Sven Koenig, Milind Tambe. cp 2004: 706-710 [doi]

Lifelong Planning ASven Koenig, Maxim Likhachev, David Furcy. ai, 155(1-2):93-146, 2004. [doi]

A Comparison of Fast Search Methods for Real-Time Situated AgentsSven Koenig. atal 2004: 864-871 [doi]

Incremental Heuristic Search in AISven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy. aim, 25(2):99-112, 2004.

Analysis of Greedy Robot-Navigation MethodsApurva Mudgal, Craig A. Tovey, Sven Koenig. amai 2004: [doi]

Building Terrain-Covering Ant Robots: A Feasibility StudyJonas Svennebring, Sven Koenig. arobots, 16(3):313-332, 2004. [doi]

The Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04)Shlomo Zilberstein, Jana Koehler, Sven Koenig. aim, 25(4):101-104, 2004.

Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), June 3-7 2004, Whistler, British Columbia, CanadaShlomo Zilberstein, Jana Koehler, Sven Koenig, editors, AAAI, 2004.

2003

2002

The interaction of representations and planning objectives for decision-theoretic planning tasksSven Koenig, Yaxin Liu. jetai, 14(4):303-326, 2002. [doi]

D*LiteSven Koenig, Maxim Likhachev. AAAI 2002: 476-483

Improved Fast Replanning for Robot Navigation in Unknown TerrainSven Koenig, Maxim Likhachev. icra 2002: 968-975

Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, ProceedingsSven Koenig, Robert C. Holte, editors, Volume 2371 of Lecture Notes in Computer Science, Springer, 2002.

Heuristic Search-Based ReplanningSven Koenig, David Furcy, Colin Bauer. aips 2002: 294-301

Speeding up the Parti-Game AlgorithmMaxim Likhachev, Sven Koenig. nips 2003: 1563-1570 [doi]

Speeding Up the Calculation of Heuristics for Heuristic Search-Based PlanningYaxin Liu, Sven Koenig, David Furcy. AAAI 2002: 484-491

Towards Building Terrain-Covering Ant RobotsJonas Svennebring, Sven Koenig. antalg 2002: 202-215 [doi]

2001

Probabilistic Planning for Behavior-Based RobotsAmin Atrash, Sven Koenig. flairs 2001: 531-535

Greedy Mapping of TerrainSven Koenig, Craig A. Tovey, William Halliburton. icra 2001: 3594-3599

Minimax real-time heuristic searchSven Koenig. ai, 129(1-2):165-197, 2001. [doi]

Agent-Centered SearchSven Koenig. aim, 22(4):109-132, 2001.

Efficient and inefficient ant coverage methodsSven Koenig, Boleslaw K. Szymanski, Yaxin Liu. AMAI, 31(1-4):41-76, 2001.

Terrain coverage with ant robots: a simulation studySven Koenig, Yaxin Liu. agents 2001: 600-607 [doi]

Incremental A*Sven Koenig, Maxim Likhachev. nips 2001: 1539-1546 [doi]

Lifelong Planning for Mobile RobotsMaxim Likhachev, Sven Koenig. dagstuhl 2002: 140-156 [doi]

2000

Speeding up the Convergence of Real-Time SearchDavid Furcy, Sven Koenig. AAAI 2000: 891-897

Representations of Decision-Theoretic Planning TasksSven Koenig, Yaxin Liu. aips 2000: 187-195

From Animals to Animats 5 : Proceedings of the Fifth International Conference on Simulation of Adaptive BehaviorSven Koenig. alife, 6(3):255-258, 2000.

Planning-Task Transformations for Soft DeadlinesSven Koenig. atal 2001: 305-319 [doi]

Gridworlds as Testbeds for Planning with Incomplete InformationCraig A. Tovey, Sven Koenig. AAAI 2000: 819-824

PreviousNext