ScottyActivity: mixed discrete-continuous planning with convex optimization

DOI10.1613/JAIR.1.11219zbMATH Open1448.68433OpenAlexW2883331799WikidataQ129461835 ScholiaQ129461835MaRDI QIDQ4580277FDOQ4580277

Enrique Fernandez-Gonzalez, Brian C. Williams, E. Karpas

Publication date: 14 August 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11219

Recommendations

• Hierarchical trajectory optimization for a class of hybrid dynamical systems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• COLIN: planning with continuous linear numeric change
• Modelling mixed discrete-continuous domains for planning
• Combined time and energy optimal trajectory planning with quadratic drag for mixed discrete-continuous task planning

Mathematics Subject Classification ID

Convex programming (90C25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Cited In (4)

• Minimum mixed time-energy trajectory planning of a nonlinear vehicle subject to 2D disturbances
• Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search
• Optimal mixed discrete-continuous planning for linear hybrid systems
• Gradient-based mixed planning with symbolic and numeric action parameters

This page was built for publication: ScottyActivity: mixed discrete-continuous planning with convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580277)