Զѧ
ACTA AUTOMATICA SINICA
1999ꡡ255ڡVol.25 No.5 1999



ʽϵͳ·滮
ʽϷ
롡ڹ⻪ΰ
ժҪԷʽϵͳһ·滮㷨.㷨Ϊѵķϵͳ·滮תΪ˵Ķʽ⣬ʹ·滮õ򻯣ҿԺ׵Ӧڸӻµ·滮.֤ʵ˸÷Ч.
ؼʡϵͳʽϵͳ·滮ʽ
PATH PLANNING OF NOHOLONOMIC CHAINED SYSTEMSA POLYNOMIAL FITTING APPROACH
MA BaoliZONG GuanghuaHUO Wei
(The Seventh Research Division, Beijing Univ. of Aero. and Astro.,Beijing100083)
AbstractA new algorithm is presented to solve the path planning problem of nonholonomic chained systems. By the algorithm, the intricated nonholonomic path planning problem can be transformed into a polynomial fitting problem satisfying some given boundary conditions. The algorithm simplifies the path planning problem and can easily handle other complex geometric constraints. Simulation of a four wheel mobile cart is implemented to verify effectiveness of the proposed algorithm.
Key wordsNonholonomic system, path planning, chained system, polynomial fitting.
1
ϵͳ·滮ͿѳΪ۽һоȵ.ϵͳȣϵͳ·滮.Ҫ״̬Լ⣬ʹ滮·ÿһ㴦Լ.ڷϵͳоУʽϵͳҪ.Ϊһķϵͳһ¿ͨ״̬任ΪʽϵͳرǴʵʵķеϵͳһ㶼ɻΪʽϵͳ1.ף1ʽϵͳṹ򵥡׻ֵص㣬ֱȡΪδ֪ϵǺֶγֵͶʽֱַͨõ״̬̬ʽȻɴ˱ʽ̬ȷеδ֪ϵ.˷ҪȱǲӦڸӻµ·滮(խͨ).
ʽϵͳһµ·滮÷·滮תΪ֪˵Ķʽ.ף1ݵķȣ÷Ϊɺڸӻµ·滮.֤ʵ˱ķЧ.
2ʽϵͳ·滮
µķϵͳ
(1)
Ȼϵͳ(1)ܵ(n-2)Լ
(2)
ϵͳ·滮Ϊ״̬ռRn=xx=x1,xnTӳ̬x(t0)̬x(tf)Լ(2)·.
ʽ(1)(2)ɵõ
(3)
ʽ(3)֪ʽϵͳ·滮תΪ¶˵ĺxn(x1)=f(x1)⣺

(4)
ʽx10=x1(t0)x1f=x1(tf).
Ϊ(4)ʽ2(n-1)˵ѡ2n-3׶ʽ2
(5)
Ϊ滮·.ʽдĳϵck(k=0,1,,2n-3)ɶ˵ʽ(4)ȷ.
ע1.ԭҲѡȡĺ(Ǻ)ϣҿЧã˴Ϊ򵥼ƶѡ˶ʽ.
ʽ(5)
(6)
ʽ(5)(6)˵(4)ɵõԷ
Mc=a(7)

a=xn(t0),xn-1(t0)x2(t0)xn(tf),xn-1(tf),x2(tf)T



i=1,n-1j=1,2(n-1).
Tʱʽ(7)ɽϵ
c=M-1a.
ע2.1)x10=x1fʱT죬ʱxn0xnfת任x10x1fֱ任Ϊxnew10xnew1fʹxnew10xnew1f.
2)x10=x1fxn0=xnfӦѡһͬյĵΪ滮·ϵһ㣬Ȼٷֱ滮㵽õԼӸõ㵽յ·.
ϽԼ״̬ļιߣΪõ״̬ͿƵʱߣx1ʱ켣.ԭϣx1(t)ȡΪһ˵x1(t0)=x10x1(tf)=x1f.磬ɼ򵥵ȡΪx1(t)=x10+(x1f-x10)t.x1(t)ȷ󣬿ɵõu1,u2Ϊ

3ӻµ·滮
ʵӦУҪӵĻԼ.Ϊʹ滮·ЩԼɸݻʵѡȡ㣬ʹ滮·ͨЩ㣬Ӷ滮㸴ӻԼ·.ٶΪ㸴ӻԼѡȡmΪ(x11,xn1)(x12,xn2)(x1m,xnm)·滮ɻΪ˵Լ(4)ͻԼ
xn1=f(x11),xn2=f(x12),xnm=f(x1m)(8)
·滮.mԼӦѡ2n-3+m׶ʽ

Ϊ·.ʽn-2+mβԼ(4)(8)ɵõϵcjԷ飬ЩϵɵõԼ·.
4о
СΪ˵Ч.С˶Ϊ
(9)
(x,y)ΪСеλãΪ̬ΪǰֵĲݽǣv1Ϊǰٶȣv2Ϊݽٶ.
µ״̬任任

ɽϵͳ(9)ΪµĽʽϵͳ

t0=0,tf=1ϵͳĳ̬x(t0),y(t0),(t0),(t0)T=101000T̬x(tf),y(tf)(tf),(tf)T=0000Tȡx1(t)=1(t)=x10+(x1f-x10)t.
1.ϰﻷͼ1ͼ2ʾԿ״̬x(t),y(t),(t),(t)ݾt=1ʱ㣬ͬʱ滮ļ·ҲǺ.


ͼ11״̬x(t),y(t),(t),(t)ݵʱ켣


ͼ21Сļ˶켣x-y
2.ͨٶ(x,y)=(4,5)(x,y)=(7,5)֮һ3ף1׵ͨҪСλõ˶дͨ.Ȼ1滮·.Ϊˣͨѡȡĸ(x1,y1)=(4,5)(x2,y2)=(5,5),(x3,y3)=(65)(x4,y4)=(7,5)Ϊ滮·ϵĵ㣬½·滮ͼ3ͼ4ʾԿ״̬x(t),y(t),(t),(t)ݾt=1ʱ㣬ͬʱ滮ļ·Ҳôͨ.



ͼ32״̬x(t),y(t),(t),(t)ݵʱ켣


ͼ42Сļ˶켣x-y
߼飺롡19981.
ڹ⻪19431966ҵڱҵѧ.1981ҵڱպѧ˶ʿѧλ.Ϊպѧڣʿʦ.оΪѧ.
ΰ19943.
ߵλպѧоҡ100083
ο
1Tibury D, Murray R M, Sastry S S. Trajectory generation for the N-trailer problem using Goursat norm form.IEEE Trans. on Automatic Control,1995AC-40(5)802819
2Faux I D, Pratt M J. Computational Geometry for Design and Manufacture. London:John Wiley and Sons Limited,1987
ոڣ1997-08-20
޸ڣ1998-09-09
