The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sven Koenig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. Agent Coordination with Regret Clearing. [Citation Graph (, )][DBLP]


  76. Sequential Incremental-Value Auctions. [Citation Graph (, )][DBLP]


  77. Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. [Citation Graph (, )][DBLP]


  78. Progress on Agent Coordination with Cooperative Auctions. [Citation Graph (, )][DBLP]


  79. Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. [Citation Graph (, )][DBLP]


  80. Speeding up moving-target search. [Citation Graph (, )][DBLP]


  81. An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functions. [Citation Graph (, )][DBLP]


  82. Generalized Adaptive A*. [Citation Graph (, )][DBLP]


  83. BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. [Citation Graph (, )][DBLP]


  84. Reaction functions for task allocation to cooperative agents. [Citation Graph (, )][DBLP]


  85. Trading off solution cost for smaller runtime in DCOP search algorithms. [Citation Graph (, )][DBLP]


  86. Caching schemes for DCOP search algorithms. [Citation Graph (, )][DBLP]


  87. Fast winner determination for agent coordination with SBB auctions. [Citation Graph (, )][DBLP]


  88. Simple optimization techniques for A*-based search. [Citation Graph (, )][DBLP]


  89. Dynamic fringe-saving A*. [Citation Graph (, )][DBLP]


  90. Generalized Fringe-Retrieving A*: faster moving target search on state lattices. [Citation Graph (, )][DBLP]


  91. Moving target D* Lite. [Citation Graph (, )][DBLP]


  92. ESP: pursuit evasion on series-parallel graphs. [Citation Graph (, )][DBLP]


  93. IDB-ADOPT: A Depth-First Search DCOP Algorithm. [Citation Graph (, )][DBLP]


  94. Multi-robot routing with linear decreasing rewards over time. [Citation Graph (, )][DBLP]


  95. Algorithms and Complexity Results for Pursuit-Evasion Problems. [Citation Graph (, )][DBLP]


  96. Efficient Incremental Search for Moving Target Search. [Citation Graph (, )][DBLP]


  97. K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. [Citation Graph (, )][DBLP]


  98. Incremental Phi*: Incremental Any-Angle Path Planning on Grids. [Citation Graph (, )][DBLP]


  99. Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. [Citation Graph (, )][DBLP]


  100. Offline Planning with Hierarchical Task Networks in Video Games. [Citation Graph (, )][DBLP]


  101. Multi-robot routing with rewards and disjoint time windows. [Citation Graph (, )][DBLP]


  102. Robot coverage of terrain with non-uniform traversability. [Citation Graph (, )][DBLP]


  103. Improving Sequential Single-Item Auctions. [Citation Graph (, )][DBLP]


  104. Negotiation with reaction functions for solving complex task allocation problems. [Citation Graph (, )][DBLP]


  105. Comparing real-time and incremental heuristic search for real-time situated agents. [Citation Graph (, )][DBLP]


Search in 2.444secs, Finished in 2.451secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002