2000
DOI: 10.1007/978-3-7091-2498-7_40
|View full text |Cite
|
Sign up to set email alerts
|

A New Local Path Planner for a Nonholonomic Wheeled Mobile Robot in Cluttered Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2000
2000
2000
2000

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…General regrouping rules can be formulated by exploitation of the recursive calculation of Hi (14). If one colunu1 or a linear combination of columns of Li is constant and the corresponding columns of K i ·are zero columns, condition ( 16) is fulfilled and the parameters can be regrouped.…”
Section: Regrouping Conditionsmentioning
confidence: 99%
See 4 more Smart Citations
“…General regrouping rules can be formulated by exploitation of the recursive calculation of Hi (14). If one colunu1 or a linear combination of columns of Li is constant and the corresponding columns of K i ·are zero columns, condition ( 16) is fulfilled and the parameters can be regrouped.…”
Section: Regrouping Conditionsmentioning
confidence: 99%
“…The MDH parameters are given in tabular 1. The presented algorithm offers the opportunity to simplify each link's contribution H, before using it for calculation of the next link's contribution HH 1 according to (14). Due to the symmetric structure of the links the robot has only 31 non-zero dynamic parameters (see tabular2).…”
Section: Regrouping Conditionsmentioning
confidence: 99%
See 3 more Smart Citations