Motion Planning with Complex Tasks - Revision history

Ewolff: Blanked the page

2012-12-22T17:54:05Z

Blanked the page

← Older revision		Revision as of 17:54, 22 December 2012
Line 1:		Line 1:
	~~'''Title''': Robot Motion Planning with Complex Tasks~~

	~~'''Mentor''': Richard Murray~~

	~~'''Co-mentor''': Eric Wolff~~

	~~'''Overview''':~~
	For the widespread use of robots and autonomous vehicles, it is necessary for humans to naturally specify tasks for robots and have the robots automatically synthesize relevant control policies. Recent work specifies these complex tasks with temporal logics and automatically creates control policies that satisfy the task if possible. Typically, this approach involves first creating a finite state abstraction (e.g., a graph) based on the original continuous system and then using graph search techniques to create a control policy. This project will expand current capabilities by including stochastic systems where actuator noise and uncertainty are important. Additionally, it will allow the minimization of cost functions (such as time or fuel) to be included along with the logical tasks. All software will be released as part of the Temporal Logic Planning Toolbox (TuLiP)[1]. Finally, there will be an opportunity to implement these algorithms on real robots in the lab as time permits.

	~~'''Goals''':~~
	This project will (i) expand the available solvers for stochastic systems [2] and optimal control problems [3], (ii) empirically analyze the performance of these solvers on robot motion planning problems, and (iii) implement the above algorithms on real robots in the lab. Open research questions include: determining good finite state abstractions of stochastic systems (theoretical performance bounds and computational techniques) and creating new state abstraction algorithms that utilize information from a cost function.

	'''Required Skills''': Experience with the Python language or the ability to learn it in a short time is required. Familiarity with or interest to learn automata theory, formal languages, and model checking (see the first 5 lectures in [4]) is desired. Some hands-on experience with robots (mechatronics) and the Robot Operating System (ROS) is desired but not necessary.


	~~'''References'''~~

	[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).

	~~[2] E.M. Wolff, U. Topcu, R.M. Murray, Robust control of uncertain Markov decision processes with temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)~~

	~~[3] E.M. Wolff, U. Topcu, R.M. Murray, Optimal control with weighted average costs and temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)~~

	~~[4] EECI, "Specification, Design, and Verification of Distributed Embedded Systems" course website, http://www.cds.caltech.edu/~murray/wiki/index.php/HYCON-EECI,_Spring_2012.~~

Ewolff at 17:52, 22 December 2012

2012-12-22T17:52:22Z

← Older revision		Revision as of 17:52, 22 December 2012
Line 1:		Line 1:
	Title: Robot Motion Planning with Complex Tasks		'''Title''': Robot Motion Planning with Complex Tasks

	Mentor: Richard Murray		'''Mentor''': Richard Murray

	Co-mentor: Eric Wolff		'''Co-mentor''': Eric Wolff

	Overview:		'''Overview''':
	For the widespread use of robots and autonomous vehicles, it is necessary for humans to naturally specify tasks for robots and have the robots automatically synthesize relevant control policies. Recent work specifies these complex tasks with temporal logics and automatically creates control policies that satisfy the task if possible. Typically, this approach involves first creating a finite state abstraction (e.g., a graph) based on the original continuous system and then using graph search techniques to create a control policy. This project will expand current capabilities by including stochastic systems where actuator noise and uncertainty are important. Additionally, it will allow the minimization of cost functions (such as time or fuel) to be included along with the logical tasks. All software will be released as part of the Temporal Logic Planning Toolbox (TuLiP)[1]. Finally, there will be an opportunity to implement these algorithms on real robots in the lab as time permits.		For the widespread use of robots and autonomous vehicles, it is necessary for humans to naturally specify tasks for robots and have the robots automatically synthesize relevant control policies. Recent work specifies these complex tasks with temporal logics and automatically creates control policies that satisfy the task if possible. Typically, this approach involves first creating a finite state abstraction (e.g., a graph) based on the original continuous system and then using graph search techniques to create a control policy. This project will expand current capabilities by including stochastic systems where actuator noise and uncertainty are important. Additionally, it will allow the minimization of cost functions (such as time or fuel) to be included along with the logical tasks. All software will be released as part of the Temporal Logic Planning Toolbox (TuLiP)[1]. Finally, there will be an opportunity to implement these algorithms on real robots in the lab as time permits.

	Goals:		'''Goals''':
	This project will (i) expand the available solvers for stochastic systems [2] and optimal control problems [3], (ii) empirically analyze the performance of these solvers on robot motion planning problems, and (iii) implement the above algorithms on real robots in the lab. Open research questions include: determining good finite state abstractions of stochastic systems (theoretical performance bounds and computational techniques) and creating new state abstraction algorithms that utilize information from a cost function.		This project will (i) expand the available solvers for stochastic systems [2] and optimal control problems [3], (ii) empirically analyze the performance of these solvers on robot motion planning problems, and (iii) implement the above algorithms on real robots in the lab. Open research questions include: determining good finite state abstractions of stochastic systems (theoretical performance bounds and computational techniques) and creating new state abstraction algorithms that utilize information from a cost function.

	Required Skills: Experience with the Python language or the ability to learn it in a short time is required. Familiarity with or interest to learn automata theory, formal languages, and model checking (see the first 5 lectures in [4]) is desired. Some hands-on experience with robots (mechatronics) and the Robot Operating System (ROS) is desired but not necessary.		'''Required Skills''': Experience with the Python language or the ability to learn it in a short time is required. Familiarity with or interest to learn automata theory, formal languages, and model checking (see the first 5 lectures in [4]) is desired. Some hands-on experience with robots (mechatronics) and the Robot Operating System (ROS) is desired but not necessary.


	References		'''References'''

	[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).		[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).

Ewolff at 17:51, 22 December 2012

2012-12-22T17:51:13Z

← Older revision		Revision as of 17:51, 22 December 2012
Line 1:		Line 1:
	Title: Motion Planning with Complex Tasks		Title: Robot Motion Planning with Complex Tasks

	Mentor: Richard Murray		Mentor: Richard Murray
Line 15:		Line 15:

	References		References

	[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).		[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).

Ewolff at 17:50, 22 December 2012

2012-12-22T17:50:33Z

← Older revision		Revision as of 17:50, 22 December 2012
Line 2:		Line 2:

	Mentor: Richard Murray		Mentor: Richard Murray

	Co-mentor: Eric Wolff		Co-mentor: Eric Wolff

Line 15:		Line 16:
	References		References
	[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).		[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).

	[2] E.M. Wolff, U. Topcu, R.M. Murray, Robust control of uncertain Markov decision processes with temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)		[2] E.M. Wolff, U. Topcu, R.M. Murray, Robust control of uncertain Markov decision processes with temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)

	[3] E.M. Wolff, U. Topcu, R.M. Murray, Optimal control with weighted average costs and temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)		[3] E.M. Wolff, U. Topcu, R.M. Murray, Optimal control with weighted average costs and temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)

	[4] EECI, "Specification, Design, and Verification of Distributed Embedded Systems" course website, http://www.cds.caltech.edu/~murray/wiki/index.php/HYCON-EECI,_Spring_2012.		[4] EECI, "Specification, Design, and Verification of Distributed Embedded Systems" course website, http://www.cds.caltech.edu/~murray/wiki/index.php/HYCON-EECI,_Spring_2012.

Ewolff: Created page with "Title: Motion Planning with Complex Tasks Mentor: Richard Murray Co-mentor: Eric Wolff Overview: For the widespread use of robots and autonomous vehicles, it is necessary fo..."

2012-12-22T17:49:25Z

Created page with "Title: Motion Planning with Complex Tasks Mentor: Richard Murray Co-mentor: Eric Wolff Overview: For the widespread use of robots and autonomous vehicles, it is necessary fo..."

New page

Title: Motion Planning with Complex Tasks

Mentor: Richard Murray
Co-mentor: Eric Wolff

Overview:
For the widespread use of robots and autonomous vehicles, it is necessary for humans to naturally specify tasks for robots and have the robots automatically synthesize relevant control policies. Recent work specifies these complex tasks with temporal logics and automatically creates control policies that satisfy the task if possible. Typically, this approach involves first creating a finite state abstraction (e.g., a graph) based on the original continuous system and then using graph search techniques to create a control policy. This project will expand current capabilities by including stochastic systems where actuator noise and uncertainty are important. Additionally, it will allow the minimization of cost functions (such as time or fuel) to be included along with the logical tasks. All software will be released as part of the Temporal Logic Planning Toolbox (TuLiP)[1]. Finally, there will be an opportunity to implement these algorithms on real robots in the lab as time permits.

Goals:
This project will (i) expand the available solvers for stochastic systems [2] and optimal control problems [3], (ii) empirically analyze the performance of these solvers on robot motion planning problems, and (iii) implement the above algorithms on real robots in the lab. Open research questions include: determining good finite state abstractions of stochastic systems (theoretical performance bounds and computational techniques) and creating new state abstraction algorithms that utilize information from a cost function.

Required Skills: Experience with the Python language or the ability to learn it in a short time is required. Familiarity with or interest to learn automata theory, formal languages, and model checking (see the first 5 lectures in [4]) is desired. Some hands-on experience with robots (mechatronics) and the Robot Operating System (ROS) is desired but not necessary.

References
[1] T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, and R.M. Murray, TuLiP: a software toolbox for receding horizon temporal logic planning, International Conference on Hybrid Systems: Computation and Control, 2011 (software available at http://tulip-control.sourceforge.net).
[2] E.M. Wolff, U. Topcu, R.M. Murray, Robust control of uncertain Markov decision processes with temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)
[3] E.M. Wolff, U. Topcu, R.M. Murray, Optimal control with weighted average costs and temporal logic specifications. (http://www.cds.caltech.edu/~ewolff/publications.html)
[4] EECI, "Specification, Design, and Verification of Distributed Embedded Systems" course website, http://www.cds.caltech.edu/~murray/wiki/index.php/HYCON-EECI,_Spring_2012.