Main Page
About this Wiki
Following the discussions at the TAMP workshop in RSS2016, a document was sketched for initiating thinking together about benchmarking for CTAMP planners. This wiki was created based on the previous document : we need more space to conduct proper discussions, and we may also have to share downloadable content later on. For now, the contents of the document were simply copy-pasted into different pages (sections Contents and Discussions below). Participants are invited to comment, correct, discuss, and bring their ideas.
Aims
My proposal is to start with a set of simple benchmark problems, which can be handled by the largest number of existing systems. This requires to identify the least common denominator, in terms of requirements and problem specification, at logical and geometric levels.
These requirements will be extended later on, but in order to reach a “critical mass” so that enough people start using these benchmarks and disseminate them through their publications, we need to begin with something simple and accessible.
How to edit this document
The original document has been split into pages corresponding to the sections of the document.
In the Contents section, the comments have been pasted in the Discussion pages, in the form of discussion threads. We should edit the main pages whenever an agreement has been reached.
In the Discussion section, the main page is organized as a discussion thread.
Contents
- Requirements (based on the article by Neil[1])
- General Assumptions
- Metrics
- Problems
- Practical Issues
Discussions
References
- ↑ Neil T. Dantam, Zachary K. Kingston, Swarat Chaudhuri, and Lydia E. Kavraki, Incremental Task and Motion Planning: A Constraint-Based Approach, (TAMP Workshop, RSS2016).
