Léon Planken
Delft University of Technology
Publications
ALG Group
EWI
ALG
Léon Planken
Publications
Home
Personal Corner
Publications
MaSTP Project
Publications
Add or change here
2012
Leon R. Planken
and
Mathijs M. de Weerdt
and Roman P.J. van der Krogt (2012).
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
.
Journal of Artificial Intelligence Research
43:353-388. [
Bibtex
]
2011
Ot ten Thije and
Leon R. Planken
and
Mathijs M. de Weerdt
(2011).
Maintaining Partial Path Consistency in STNs under Event-Incremental Updates
. In
Proceedings of the PlanSIG workshop
. [
Bibtex
]
Leon R. Planken
and
Mathijs M. de Weerdt
and Roman P.J. van der Krogt (2011).
Computing all-pairs shortest paths by leveraging low treewidth
. In
Proceedings of the Twenty-first International Conference on Automated Planning and Scheduling (ICAPS-11)
, pp. 170--177, Freiburg. AAAI Press. [
Bibtex
]
2010
Leon R. Planken
and
Mathijs M. de Weerdt
and
Cees Witteveen
(2010).
Optimal Temporal Decoupling in Multiagent Systems
. In Van der Hoek and Kaminka and Lesperance and Luck and Sen (Eds.),
Proceedings of the Ninth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-10)
, pp. 789-796, Toronto. IFAAMAS. [
Bibtex
]
Leon R. Planken
and
Mathijs M. de Weerdt
and Neil Yorke-Smith (2010).
Incrementally Solving STNs by Enforcing Partial Path Consistency
. In Joerg Hoffmann and Henry Kautz and Ronen Brafman and Hector Geffner (Eds.),
Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS-10)
, pp. 129-136. AAAI Press. [
Bibtex
]
Behnam Jalilzadeh and
Leon R. Planken
and
Mathijs M. de Weerdt
(2010).
Mechanism Design for the Online Allocation of Items without Monetary Payments
. In Onn Shehory and David Sarne and Esther David (Eds.),
Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets
, pp. 74-87. Lecture Notes in Business Information Processing 59, Springer. [
Bibtex
]
2008
Leon R. Planken
(2008).
Incrementally Solving the STP by Enforcing Partial Path Consistency
. In Ruth Aylett and Ivan Petillot (Eds.),
Proceedings of the 27th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2008)
, pp. 87--94, Edinburgh. [
Bibtex
]
Leon R. Planken
and
Mathijs M. de Weerdt
and Roman P.J. van der Krogt (2008).
P3C: A New Algorithm for the Simple Temporal Problem
. In Jussi Rintanen and Bernhard Nebel and J. Christopher Beck and Eric Hansen (Eds.),
Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)
, pp. 256--263. AAAI Press. [
Bibtex
]
Leon R. Planken
(2008).
New Algorithms for the Simple Temporal Problem
. Master Thesis, Delft University of Technology. [
Bibtex
]
2007
Leon R. Planken
(2007).
Temporal Reasoning Problems and Algorithms for Solving Them (literature survey)
. Master Thesis, Delft University of Technology. [
Bibtex
]
Top of the page
The newest version of this page can be found at:
http://www.st.ewi.tudelft.nl/~planken/publications.php
Last modified: Wed, 23 May 2012 04:30:54 GMT
Copyright © 2005
Léon Planken
. Please send e-mail if you find any errors or omissions.
All Rights Reserved. Design A. Iosup.