Jianxin Zeng, Yaonan Wang, Zhiqiang Miao, Sifei Wang
{"title":"Motion Planning for Mobile Robots with Temporal Logic Specifications","authors":"Jianxin Zeng, Yaonan Wang, Zhiqiang Miao, Sifei Wang","doi":"10.1109/ICARM58088.2023.10218822","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a motion planning method for mobile robots in order to satisfy task requirements specified in linear temporal logic (LTL). The proposed method follows the traditional hierarchical planning workflow, including path planning and trajectory planning. Firstly, we propose a path planning method based on rapidly exploring random trees (RRT*) and Dubins curve. The tree derived from RRT* is expanded with the help of Buchi automaton converted by an LTL formula. The proposed method can automatically adjust the iterations of sampling according to the scale of Buchi automata. Then, we formulate an optimization problem for the generation of trajectory. We use Bezier curve to express the trajectory and use differential flatness of mobile robots to simplify the optimization problem. Finally, we validate the practicality of our method through simulations and real-world experiments.","PeriodicalId":220013,"journal":{"name":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARM58088.2023.10218822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a motion planning method for mobile robots in order to satisfy task requirements specified in linear temporal logic (LTL). The proposed method follows the traditional hierarchical planning workflow, including path planning and trajectory planning. Firstly, we propose a path planning method based on rapidly exploring random trees (RRT*) and Dubins curve. The tree derived from RRT* is expanded with the help of Buchi automaton converted by an LTL formula. The proposed method can automatically adjust the iterations of sampling according to the scale of Buchi automata. Then, we formulate an optimization problem for the generation of trajectory. We use Bezier curve to express the trajectory and use differential flatness of mobile robots to simplify the optimization problem. Finally, we validate the practicality of our method through simulations and real-world experiments.