The principle of dividing feasible trajectories in a robot control problem

被引:3
作者
Bereznev, V. A. [1 ]
机构
[1] RAS, Fed Res Ctr CSC, Vavilova Str 42, Moscow 119333, Russia
来源
14TH INTERNATIONAL SYMPOSIUM INTELLIGENT SYSTEMS | 2021年 / 186卷
关键词
control of robot; feasible trajectory; theory of graphs;
D O I
10.1016/j.procs.2021.04.219
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The problem of control of mobile robot is considered. It is assumed that the start and end points of the trajectory are set, and one or more obstacles in the form of circles are present on the line connecting these points. Circles are defined by the coordinates of their centers and the lengths of their radius. The feasible trajectory must not share points with the interiors of these circles. The proposed principle is to represent any feasible trajectory as a sequence of straight sections and arcs of circles that limit circular obstacles. The robot's movement along straight sections is described by a second-order differential equation, and the movement along arcs is uniform with a given minimum speed. (C) 2021 The Authors. Published by Elsevier B.V.
引用
收藏
页码:456 / 459
页数:4
相关论文
共 6 条
[1]  
Bereznev V.A., 2019, RELIABILITY QUALITY, V3, P17
[2]  
BOLTYANSKY VG, 1968, MATH METHODS OPTIMAL
[3]  
Dijkstra E. W., 1959, NUMERISCHE MATH, V1, P269, DOI [10.1007/BF01386390/METRICS, 10.1007/BF01386390, DOI 10.1007/BF01386390]
[4]  
Izmailov A.F., 2003, FIZMATLIT
[5]  
Karmanov V. G., 2000, Mathematical Programming
[6]  
Pontryagin L.S., 1960, MATH THEORY OPTIMAL