z-logo
open-access-imgOpen Access
Object Search Algorithm under Dynamic Programming in the Tree-Type Maze
Author(s) -
In-Hun Jang,
Donghoon Lee,
Kwee-Bo Sim
Publication year - 2005
Publication title -
international journal of fuzzy logic and intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.296
H-Index - 9
eISSN - 2093-744X
pISSN - 1598-2645
DOI - 10.5391/ijfis.2005.5.4.333
Subject(s) - concatenation (mathematics) , object (grammar) , dynamic programming , type (biology) , robot , computer science , tree (set theory) , algorithm , mobile robot , mathematics , artificial intelligence , mathematical optimization , arithmetic , combinatorics , ecology , biology
This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom