International Conference on Automated Planning and Scheduling (ICAPSTask and Motion Policy Synthesis as Liveness Games Yue Wang and Neil T. Dantam and Swarat Chaudhuri and Lydia E. Kavraki Department of Computer

First Page		Document Content
Date: 2016-07-08 17:59:42 Theoretical computer science Robot kinematics Constraint programming NP-complete problems Motion planning Pursuit-evasion Satisfiability modulo theories Automated planning and scheduling Liveness		International Conference on Automated Planning and Scheduling (ICAPSTask and Motion Policy Synthesis as Liveness Games Yue Wang and Neil T. Dantam and Swarat Chaudhuri and Lydia E. Kavraki Department of Computer Add to Reading List Source URL: www.neil.dantam.name Download Document from Source Website File Size: 1,16 MB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document