{"title":"移动机器人的认知碰撞预测与路径规划:一种定性方法","authors":"B. Far, Takeshi Itoh, M. Sampei, M. Nakamichi","doi":"10.1109/IROS.1989.637924","DOIUrl":null,"url":null,"abstract":"means of nonmonotonic temporal logic and qualitative reasoning techniques. In order t o meet the on l ine limitations, t h e method of discrete i terat ion is exploited t o produce t h e path without running the goal seeking algorithm again. The above techniques a r e implemented in a program. The paper demonstrates our approach through an example. 1. I N T R O D U C T I O N Collision prediction, coll ision avoidance and path planning problems can all be formulated in a similar way, they all begin with a given present state and some assertions on t h e goal in a defined scenario, and t h e robots a r e required t o predict t h e possible collision and decide upon the control t o achieve t h e goal o r subgoals satisfactorily. The abstract knowledge in all cases along with the spatiotemporal coordination remain the same. In t h e path planning case the concentration is on the spat ia l argument and in coll ision prediction avoidance t h e temporality is mainly concerned. Collision avoidance makes use of both. 1 1 . T h e p r o b l e m In ordcr t o sce what a r e the problems if one t r ies t o predict cvcnts in the ruturc and control them, suppose tha t the two dimensional scenario is composed of two mobile robots M I and M P with the preset goals G and G P respectively, approaching cach othcr , and the i r t ra jec tor ies intersect spat ia l ly as in Fig. 1. Each robot has a potent ia l behavior [14] in t h e lack of any o ther obstacle interrupting its t r a j e c t o r y (Fig.1-a). In case of collision only par t s of the potent ia l behavior un t i l the collision point is manifested and a f t e r tha t there is a new behavior which doesn't necessarily terminate t o the previously set goal (Fig.1-b).","PeriodicalId":332317,"journal":{"name":"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cognitive Collision Prediction & Path Planning Of Mobile Robots: A Qualitative Approach\",\"authors\":\"B. Far, Takeshi Itoh, M. Sampei, M. Nakamichi\",\"doi\":\"10.1109/IROS.1989.637924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"means of nonmonotonic temporal logic and qualitative reasoning techniques. In order t o meet the on l ine limitations, t h e method of discrete i terat ion is exploited t o produce t h e path without running the goal seeking algorithm again. The above techniques a r e implemented in a program. The paper demonstrates our approach through an example. 1. I N T R O D U C T I O N Collision prediction, coll ision avoidance and path planning problems can all be formulated in a similar way, they all begin with a given present state and some assertions on t h e goal in a defined scenario, and t h e robots a r e required t o predict t h e possible collision and decide upon the control t o achieve t h e goal o r subgoals satisfactorily. The abstract knowledge in all cases along with the spatiotemporal coordination remain the same. In t h e path planning case the concentration is on the spat ia l argument and in coll ision prediction avoidance t h e temporality is mainly concerned. Collision avoidance makes use of both. 1 1 . T h e p r o b l e m In ordcr t o sce what a r e the problems if one t r ies t o predict cvcnts in the ruturc and control them, suppose tha t the two dimensional scenario is composed of two mobile robots M I and M P with the preset goals G and G P respectively, approaching cach othcr , and the i r t ra jec tor ies intersect spat ia l ly as in Fig. 1. Each robot has a potent ia l behavior [14] in t h e lack of any o ther obstacle interrupting its t r a j e c t o r y (Fig.1-a). In case of collision only par t s of the potent ia l behavior un t i l the collision point is manifested and a f t e r tha t there is a new behavior which doesn't necessarily terminate t o the previously set goal (Fig.1-b).\",\"PeriodicalId\":332317,\"journal\":{\"name\":\"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.1989.637924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1989.637924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
非单调时间逻辑和定性推理技术的手段。为了满足在线的限制,利用离散化的方法来产生路径,而不需要再次运行目标搜索算法。上述技术可在程序中实现。本文通过一个实例说明了我们的方法。1. 我N T U R O D C T I O N碰撞预测,科尔避免视力和路径规划问题都可以以类似的方式,他们都从一个给定的现状和一些断言T h e目标定义的情况下,和T h e机器人R e T O预测T h e可能碰撞和决定控制T O T h e目标O R子目标圆满实现。在所有情况下,抽象知识以及时空协调都保持不变。在路径规划案例中,重点关注的是路径参数,而在碰撞预测中,主要关注的是避免碰撞的时效性。防撞系统利用了这两者。11。T h e p r o b l e m为了T o sce r e什么问题如果1 T r T o理论预测cvcnts ruturc和控制,假设那两个移动机器人的二维场景由m我和m p与预设目标G和G p分别接近cach othcr, I r T ra份额tor ies相交口角ia l ly如无花果。1。每个机器人在没有任何其他障碍物干扰的情况下,都有一个有效的内向行为[14],这意味着它的行为不会受到任何其他障碍物的干扰(图1-a)。在碰撞的情况下,在碰撞点出现之前,只有1 / 2的有效行为表现出来,1 / 4的有效行为表现出来,即出现了一个新的行为,但不一定终止于先前设定的目标(图1-b)。
Cognitive Collision Prediction & Path Planning Of Mobile Robots: A Qualitative Approach
means of nonmonotonic temporal logic and qualitative reasoning techniques. In order t o meet the on l ine limitations, t h e method of discrete i terat ion is exploited t o produce t h e path without running the goal seeking algorithm again. The above techniques a r e implemented in a program. The paper demonstrates our approach through an example. 1. I N T R O D U C T I O N Collision prediction, coll ision avoidance and path planning problems can all be formulated in a similar way, they all begin with a given present state and some assertions on t h e goal in a defined scenario, and t h e robots a r e required t o predict t h e possible collision and decide upon the control t o achieve t h e goal o r subgoals satisfactorily. The abstract knowledge in all cases along with the spatiotemporal coordination remain the same. In t h e path planning case the concentration is on the spat ia l argument and in coll ision prediction avoidance t h e temporality is mainly concerned. Collision avoidance makes use of both. 1 1 . T h e p r o b l e m In ordcr t o sce what a r e the problems if one t r ies t o predict cvcnts in the ruturc and control them, suppose tha t the two dimensional scenario is composed of two mobile robots M I and M P with the preset goals G and G P respectively, approaching cach othcr , and the i r t ra jec tor ies intersect spat ia l ly as in Fig. 1. Each robot has a potent ia l behavior [14] in t h e lack of any o ther obstacle interrupting its t r a j e c t o r y (Fig.1-a). In case of collision only par t s of the potent ia l behavior un t i l the collision point is manifested and a f t e r tha t there is a new behavior which doesn't necessarily terminate t o the previously set goal (Fig.1-b).