arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.08261cs.ROcs.SYeess.SY
收藏

线性混杂系统的最优离散-连续混合规划

Optimal Mixed Discrete-Continuous Planning for Linear Hybrid Systems

Massachusetts Institute of Technology(麻省理工学院)

Jingkai Chen, Brian Williams, Chuchu Fan

摘要:

混合系统中的离散和连续控制变量的规划是重要的处理现实世界中的应用,如行外探索和多车辆运输系统。与此同时,在特定的混合规划规范下生成高质量的解决方案对于构建高性能混合动力系统至关重要。然而,由于混合规划是具有挑战性的,一般来说,大多数方法使用贪婪搜索,这是由各种启发式,这是既不完整,也不是最优的,往往陷入盲目搜索到一个无限的行动计划。在本文中,我们提出了一个混合自动机规划形式主义,并提出了一个最佳的方法,编码这个规划问题作为一个混合线性规划(MILP)通过固定的自动机运行的动作数。我们还展示了我们的推理方法在时间上并发的目标的扩展。通过利用一个有效的MILP优化器,我们的方法是能够在合理的时间内生成复杂的混合离散-连续规划问题的可证明的最优解。我们使用几个案例研究来证明我们的混合规划方法的非凡性能,并表明它优于一个国家的最先进的混合规划,斯科蒂,在效率和解决方案的质量。

英文摘要:

Planning in hybrid systems with both discrete and continuous control variables is important for dealing with real-world applications such as extra-planetary exploration and multi-vehicle transportation systems. Meanwhile, generating high-quality solutions given certain hybrid planning specifications is crucial to building high-performance hybrid systems. However, since hybrid planning is challenging in general, most methods use greedy search that is guided by various heuristics, which is neither complete nor optimal and often falls into blind search towards an infinite-action plan. In this paper, we present a hybrid automaton planning formalism and propose an optimal approach that encodes this planning problem as a Mixed Integer Linear Program (MILP) by fixing the action number of automaton runs. We also show an extension of our approach for reasoning over temporally concurrent goals. By leveraging an efficient MILP optimizer, our method is able to generate provably optimal solutions for complex mixed discrete-continuous planning problems within a reasonable time. We use several case studies to demonstrate the extraordinary performance of our hybrid planning method and show that it outperforms a state-of-the-art hybrid planner, Scotty, in both efficiency and solution qualities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑