the paper is devoted to application of Cartesian Genetic programming (CGP) for generating optimal trajectories of a mobile robots group. the problem of a control system synthesis for a mobile robots group is solved. T...
详细信息
ISBN:
(纸本)9781728159539
the paper is devoted to application of Cartesian Genetic programming (CGP) for generating optimal trajectories of a mobile robots group. the problem of a control system synthesis for a mobile robots group is solved. the proposed algorithm uses numerical approach from the class of symbolic regression methods to which Cartesian Genetic programming belonging. It allows to receive a control function in the form of a mathematical expression. We consider several stages to get optimal trajectories for mobile robots group moving along which the robots wouldn't collide with each other and obstacles. Initially, we solve the problem of synthesis for each robot in order to get the stabilized robot control system relative some point in the state space. At the second stage, spatial trajectories are found along which robots move from the current state to the obtained equilibrium points without collisions. It was proposed to improve an initial algorithm by using the principal of small variation of basic solution. there is considered a group of three robots and the control system for them with phase constraints in the paper.
As the water depth of offshore oil fields increases, a position keeping control system on a platform equipped withthrusters has become essential. In previous control studies for position keeping, the control algorith...
详细信息
ISBN:
(纸本)1880653311
As the water depth of offshore oil fields increases, a position keeping control system on a platform equipped withthrusters has become essential. In previous control studies for position keeping, the control algorithm was restricted by the type of the platform, the number and the type of its actuators, and nonlinear characteristics of its system. the authors developed a new control algorithm to improve position keeping of a platform, and tested it by numerical simulations and tank experiments. they were the first experiments in the world conducted by reat time control of nonlinear programming.
Feature-oriented programming (FOP) is a paradigm that incorporates programming language technology, program generation techniques, and stepwise refinement. In their GPCE'07 paper, thaker et a]. suggest the develop...
详细信息
ISBN:
(纸本)9781605582672
Feature-oriented programming (FOP) is a paradigm that incorporates programming language technology, program generation techniques, and stepwise refinement. In their GPCE'07 paper, thaker et a]. suggest the development of a type system for FOP to guarantee safe feature composition, Le, to guarantee the absence of type errors during feature composition. We present such a type system along with a calculus for a simple feature-oriented, Java-like language, called Feature Featherweight Java (FFJ). Furthermore, we explore four extensions of FFJ and how they affect type soundness.
Ant colony optimization is a successful swarm intelligence method for solving various combinatorial optimization problems. It uses a population-based meta-heuristic that is based on the foraging behavior of real ant c...
详细信息
ISBN:
(纸本)9781467364195
Ant colony optimization is a successful swarm intelligence method for solving various combinatorial optimization problems. It uses a population-based meta-heuristic that is based on the foraging behavior of real ant colonies, and these ants use pheromones to communicate indirectly with others. While the scale of problem increases, ACO necessitates much more time and resource to solve the optimization problem. Two main solutions to this bottleneck can be used: distributed implementations and parallel implementations. the rapid development of computer architecture enables the easily reachable parallel implementation platforms by multi-core processors. In this paper, it is aimed to present the performance increase of two main ACO algorithms on multi-core processors with parallel programming. Parallelization is done on a single ant colony by using Java thread programming approach with minimal communication and coordination between threads. the paper also draws future works that can be done on this topic.
this paper proposes a new algorithm to generate a minimal search space of the problem of coalition structure generation using a new optimal integer partition. the new partition includes only partitions giving optimal ...
详细信息
ISBN:
(纸本)9780769529837
this paper proposes a new algorithm to generate a minimal search space of the problem of coalition structure generation using a new optimal integer partition. the new partition includes only partitions giving optimal coalition structures. these partitions are those containing I at most one element. Our new algorithm generates optimal partition structures in two steps. the first step, we use a modified version of ZS1 algorithm to generate the optimal integer partition Of input integer. We then use the partition to generate optimal coalition structures in the second step.
Interaction programming is a complex decision making model for multi-persons, which can be widely applied in fields with conflict or non-conflict, such as control problem of product plan, mutli-agents and network conf...
详细信息
In need of interesting material and effective teaching approach in programming learning, students were more likely to drop out of the course for the abstract concepts and complex structure. Despite the fact that they ...
详细信息
Significant recent effort in genetic programming has focused on selecting and combining candidate solutions according to a notion of behaviour defined in semantic space and has also highlighted disadvantages of relyin...
详细信息
暂无评论