SMT versus genetic and OpenOpt algorithms: concrete planning in the PlanICS framework

DOI10.3233/FI-2014-1134zbMATH Open1329.68047OpenAlexW1527453127MaRDI QIDQ5259304FDOQ5259304

Authors: Artur Niewiadomski, Jaroslaw Skaruz, Wojciech Penczek, MacIej Szreter, Mariusz Jarocki 

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1134

Recommendations

• Concrete planning in Plan\textsc{ics} framework by combining SMT with GEO and simulated annealing
• SMT-based abstract parametric temporal planning
• OMTPlan: A Tool for Optimal Planning Modulo Theories
• scientific article; zbMATH DE number 2243415
• Planning as satisfiability with IPC simple preferences and action costs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Internet topics (68M11)

Cited In (3)

• SMT-based abstract parametric temporal planning
• Concrete planning in Plan\textsc{ics} framework by combining SMT with GEO and simulated annealing
• OMTPlan: A Tool for Optimal Planning Modulo Theories

Uses Software

• Maple
• Matlab
• OpenOpt

This page was built for publication: SMT versus genetic and OpenOpt algorithms: concrete planning in the PlanICS framework

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