Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 246

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control

Bakdi, Azzeddine, Hentout, Abdelfetah, Boutami, Hakim, Maoudj, Abderraouf, Hachour, Ouarda, Bouzouia, Brahim·2017·Robotics and Autonomous Systems

Abstract

Abstract This paper presents preliminary results of the application of two-Kinect cameras system on a two-wheeled indoor mobile robot for off-line optimal path planning and execution. In our approach, the robot makes use of depth information delivered by the vision system to accurately model its surrounding environment through image processing techniques. In addition, a Genetic Algorithm is implemented to generate a collision-free optimal path linking an initial configuration of the mobile robot (Source) to a final configuration (Target). After that, Piecewise Cubic Hermite Interpolating Polynomial is used to smooth the generated optimal path. Finally, an Adaptive Fuzzy-Logic controller is designed to keep track of a mobile robot on the desired smoothed path (by transmitting the appropriate right and left velocities using wireless communication). In parallel, sensor fusion (odometry sensors and Kinect sensors) is used to estimate the current position and orientation of the robot using Kalman filter. The validation of the proposed solution is carried out using the differentially-driven mobile robot, RobuTER, to successfully achieve safe motion (without colliding with obstacles) in an indoor environment.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.robot.2016.12.008

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 246

Metadata

Authors
Bakdi, A., Hentout, A., Boutami, H., Maoudj, A., Hachour, O., & Bouzouia, B.
Venue
Robotics and Autonomous Systems
Publisher
Elsevier BV
Published
2017-03
Volume
89
Pages
95-109
ISSN
0921-8890 (ISSN-L)
OpenAlex
W2563320938
Cited by
246
References
1
FWCI
13.01
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.