Main Page - Revision history

Flladmin: /* About this Wiki */

2018-07-18T08:44:32Z

‎About this Wiki

Flladmin at 14:17, 17 July 2018

2018-07-17T14:17:52Z

Flladmin: /* Contact */

2018-07-17T14:17:21Z

‎Contact

Flladmin: /* How to use this wiki */

2018-07-17T14:16:49Z

‎How to use this wiki

Flladmin: /* How to use this wiki */

2018-07-17T14:15:36Z

‎How to use this wiki

Flladmin: /* How to use the wiki */

2018-07-17T14:15:01Z

‎How to use the wiki

Flladmin: /* About this Wiki */

2018-07-17T14:14:39Z

‎About this Wiki

Flladmin: /* About this Wiki */

2018-07-17T14:14:22Z

‎About this Wiki

Flladmin at 14:13, 17 July 2018

2018-07-17T14:13:15Z

Flladmin: /* Contributors */

2018-07-17T14:02:36Z

‎Contributors

@@ Line 1: / Line 1: @@
 == About this Wiki ==
-Following the RSS2016 TAMP workshop, a discussion group (see ''Contributors'' below) was created to come up with a methodology and a set of benchmark problems for TAMP. Our discussions and the actual benchmarks can be found in the '''TAMP FO-DA''' section in the ''Contents'' menu. More details can be found in [https://dspace.library.colostate.edu/bitstream/handle/11124/172349/lagriffoul-etal.pdf?sequence=1 this paper]. Our approach was to start with a set of problems which can be handled by the largest number of existing systems, by identifying the least common denominator for requirements and problem specification, at logical and geometric levels.
+Following the RSS2016 TAMP workshop, a discussion group (see ''Contributors'' below) was created to come up with a methodology and a set of benchmark problems for TAMP. Our discussions and the actual benchmarks can be found in the '''TAMP FO-DA''' section in the ''Contents'' menu. More details can be found in [https://ieeexplore.ieee.org/document/8411475/ this paper]. Our approach was to start with a set of problems which can be handled by the largest number of existing systems, by identifying the least common denominator for requirements and problem specification, at logical and geometric levels.
 However, since TAMP covers a wide range of problems, it was not possible to come up with a set of benchmarks for '''all''' types of TAMP problems. Therefore the ''Contents'' of the wiki is organized according to '''subclasses''' of TAMP. If you find the assumptions and requirements for ''TAMP FO-DA'' incompatible with the type of problems you are interested in, please contribute by creating your own benchmark set in the ''Contents'' section. Candidate subclasses are suggested:

← Older revision		Revision as of 14:17, 17 July 2018
Line 38:		Line 38:
	* 2017: [http://www.kavrakilab.org/2017-rss-workshop/ Task and Motion Planning RSS 2017]		* 2017: [http://www.kavrakilab.org/2017-rss-workshop/ Task and Motion Planning RSS 2017]
	* 2016: [http://www.kavrakilab.org/2016-rss-workshop/ Task and Motion Planning RSS 2016]		* 2016: [http://www.kavrakilab.org/2016-rss-workshop/ Task and Motion Planning RSS 2016]
−
−	~~== References ==~~

@@ Line 21: / Line 21: @@
 == Contact ==
-If you want to contribute in this wiki, contact me at fabien[dot]lagriffoul[at]oru[dot]se.
+If you want to contribute to this wiki, contact me at fabien[dot]lagriffoul[at]oru[dot]se and I'll create an account for you.
 == Contributors ==

@@ Line 18: / Line 18: @@
 * Do not create a benchmark set on your own: this has to be a collaborative work involving other researchers.
 * For discussions, use the wiki "Discussion" tab, or set up a discussion thread, by creating a page and adding the following code at the top: <nowiki>{{#useliquidthreads:1}}</nowiki> (see for example [[Comments_from_Neil|this page]])
-* Note that there is an Atom feed for each discussion page (left menu) you can subscribe to for getting updated with new replies. You can also adjust your preferences (top right menu) for getting notified by email.
+* Note that there is an Atom feed for each discussion page (left menu) you can subscribe to for getting updated with new replies. You can adjust your preferences (top right menu) for getting notified by email.
 == Contact ==

@@ Line 16: / Line 16: @@
 * This page is powered by MediaWiki, you can find instructions for editing pages [https://www.mediawiki.org/wiki/Help:Editing_pages here].
 * Do not modify a page for which you have not taken part in discussions.
-* Do not add a benchmark set on your own: this has to be a collaborative work involving other researchers.
+* Do not create a benchmark set on your own: this has to be a collaborative work involving other researchers.
 * For discussions, use the wiki "Discussion" tab, or set up a discussion thread, by creating a page and adding the following code at the top: <nowiki>{{#useliquidthreads:1}}</nowiki> (see for example [[Comments_from_Neil|this page]])
 * Note that there is an Atom feed for each discussion page (left menu) you can subscribe to for getting updated with new replies. You can also adjust your preferences (top right menu) for getting notified by email.

@@ Line 12: / Line 12: @@
 * Create your own...
-== How to use the wiki ==
+== How to use this wiki ==
 * This page is powered by MediaWiki, you can find instructions for editing pages [https://www.mediawiki.org/wiki/Help:Editing_pages here].

@@ Line 3: / Line 3: @@
 Following the RSS2016 TAMP workshop, a discussion group (see ''Contributors'' below) was created to come up with a methodology and a set of benchmark problems for TAMP. Our discussions and the actual benchmarks can be found in the '''TAMP FO-DA''' section in the ''Contents'' menu. More details can be found in [https://dspace.library.colostate.edu/bitstream/handle/11124/172349/lagriffoul-etal.pdf?sequence=1 this paper]. Our approach was to start with a set of problems which can be handled by the largest number of existing systems, by identifying the least common denominator for requirements and problem specification, at logical and geometric levels.
-However, since TAMP covers a wide range of problems, it was not possible to come up with a set of benchmarks for '''all''' types of TAMP problems. Therefore the ''Contents'' of the wiki is organized according to '''subclasses''' of TAMP. If you find the assumptions and requirements for ''TAMP FO-DA'' incompatible with the type of problems you are interested in, please contribute by creating your own benchmark set in the ''Contents'' section. Candidate subclasses are suggested.
+However, since TAMP covers a wide range of problems, it was not possible to come up with a set of benchmarks for '''all''' types of TAMP problems. Therefore the ''Contents'' of the wiki is organized according to '''subclasses''' of TAMP. If you find the assumptions and requirements for ''TAMP FO-DA'' incompatible with the type of problems you are interested in, please contribute by creating your own benchmark set in the ''Contents'' section. Candidate subclasses are suggested:
 == Contents ==

@@ Line 24: / Line 24: @@
 == Contributors ==
-* '''TAMP PO-DA''':
+* '''TAMP FO-DA''':
 ''Fabien Lagriffoul'' (Orebro University, Sweden.) <br />
 ''Neil T. Dantam'' (Colorado School of Mines, USA) <br />