Formal specification and simulation of the robot path planner

被引:1
作者
Belkhouche, M. Yassine [1 ]
Belkhouche, Boumediene [2 ]
机构
[1] Univ North Texas, Dept Comp Sci & Engn, Denton, TX 76203 USA
[2] UAE Univ, Coll Informat Technol, Al Ain, U Arab Emirates
来源
2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9 | 2009年
关键词
Hybrid Process Algebra; Mobile Robot Simulation; Hybrid Systems; Formal Specification; PROCESS ALGEBRA;
D O I
10.1109/ICSMC.2009.5346910
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Simulation software plays a very important role in education and research applications. They provide a safe, easy and flexible environment for developing and testing new methods. However developing a simulation software that reflects the exact behavior of the real system is a difficult and complicated task. In this paper we used hybrid process algebra to build a formal model that describes the exact behavior of the path planner module of autonomous mobile robots. The robot path planner is described by a powerful recursive process. The robot moves in four modes heading-regulation, move-to-goal, move-to-inter-goal, and obstacle-avoidance mode. Each motion mode is described by a process. The overall behavior of the path planner is the result of the communication between the four processes. The developed model is then implemented as simulator for mobile robots.
引用
收藏
页码:4484 / +
页数:2
相关论文
共 7 条
[1]  
ALUR R, 1994, THEORETICAL COMPUTER, V126, P235
[2]   Process algebra with propositional signals [J].
Baeten, JCM ;
Bergstra, JA .
THEORETICAL COMPUTER SCIENCE, 1997, 177 (02) :381-405
[3]  
BAETEN JCM, 2004, APPL PROCESS ALGEBRA
[4]  
BELKHOUCHE F, 2007, ADV ROBOTICS, P1
[5]   Process algebra for hybrid systems [J].
Bergstra, JA ;
Middelburg, CA .
THEORETICAL COMPUTER SCIENCE, 2005, 335 (2-3) :215-280
[6]  
CUIPERS P, 2003, 0307 EINDH U TECHN D
[7]   The theory of hybrid automata [J].
Henzinger, TA .
11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, :278-292