Strategy creation, decomposition and distribution in particle navigation

Date

2007-02-01

Author

Beldek, Ulas
Leblebicioğlu, Mehmet Kemal

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

79
views

0
downloads

Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-based hierarchical structures to move the particles in a grid region to accomplish navigation tasks. Communications operations such as receiving and sending commands between particles are also provided to develop improved strategies. In order to produce more capable strategies, a task decomposition procedure is proposed. In addition, a conflict module is constructed to handle the challenging situations and conflicts such as blockage of a particle's pathway to destination by other particles.

Subject Keywords

Control and Systems Engineering, Theoretical Computer Science, Software, Information Systems and Management, Artificial Intelligence, Computer Science Applications

URI

https://hdl.handle.net/11511/35853

Journal

INFORMATION SCIENCES

DOI

https://doi.org/10.1016/j.ins.2006.07.008

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Swarm robotics: From sources of inspiration to domains of application Şahin, Erol (Springer Verlag; 2005-09-01) Swarm robotics is a novel approach to the coordination of large numbers of relatively simple robots which takes its inspiration from social insects. This paper proposes a definition to this newly emerging approach by 1) describing the desirable properties of swarm robotic systems, as observed in the system-level functioning of social insects, 2) proposing a definition for the term swarm robotics, and putting forward a set of criteria that can be used to distinguish swarm robotics research from other multi-r...
Positive impact of state similarity on reinforcement learning performance Girgin, Sertan; Polat, Faruk; Alhaj, Reda (Institute of Electrical and Electronics Engineers (IEEE), 2007-10-01) In this paper, we propose a novel approach to identify states with similar subpolicies and show how they can be integrated into the reinforcement learning framework to improve learning performance. The method utilizes a specialized tree structure to identify common action sequences of states, which are derived from possible optimal policies, and defines a similarity function between two states based on the number of such sequences. Using this similarity function, updates on the action-value function of a st...
ADAPTIVE-CONTROL OF FLEXIBLE MULTILINK MANIPULATORS BODUR, M; SEZER, ME (Informa UK Limited, 1993-09-01) An adaptive self-tuning control scheme is developed for end-point position control of flexible manipulators. The proposed scheme has three characteristics. First, it is based on a dynamic model of a flexible manipulator described in cartesian coordinates, which eliminates the burden and inaccuracy of translating a desired end-point trajectory to joint coordinates using inverse kinematic relations. Second, the effect of flexibility is included in the dynamic model by approximating flexible links with a numbe...
A dynamic programming algorithm for tree-like weighted set packing problem Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-10-15) In hierarchical organizations, hierarchical structures naturally correspond to nested sets. That is, we have a collection of sets such that for any two sets, either one of them is a subset of the other, or they are disjoint. In other words, a nested set system forms a hierarchy in the form of a tree structure. The task assignment problem on such hierarchical organizations is a real life problem. In this paper, we introduce the tree-like weighted set packing problem, which is a weighted set packing problem r...
Linear programming based approaches for the discrete time/cost trade-off problem in project networks Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01) In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...

Citation Formats

U. Beldek and M. K. Leblebicioğlu, “Strategy creation, decomposition and distribution in particle navigation,” INFORMATION SCIENCES, pp. 755–770, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35853.