Buscar
Mostrando ítems 1-10 de 610
Mobile robot path planning using membrane evolutionary artificial potential field
(2019-01-31)
In this paper, a membrane evolutionary artificial potential field (memEAPF) approach for solving the
mobile robot path planning problem is proposed, which combines membrane computing with a genetic
algorithm (membrane-inspired ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
Studies in Computational Intelligence
(Springer, Cham, 2019-11-24)
An efficient algorithm for path generation in autonomous mobile robots using a visual recognition approach is presented. The proposal includes image filtering techniques by employing an inspecting camera to sense a cluttered ...
Complexity paths in neo-Schumpeterian evolutionary economics, structural change and development policies
(Elsevier, 2016-09)
Recently, several authors of evolutionary and neo-Schumpeterian economics have identified in complex systems a common framework for accounting for a range of attributes they have been claiming are present in economic ...
Studies in computational intelligence
(Springer, 2020-02-28)
In this work, a mobile robot path-planning algorithm based on the evolutionary artificial potential field (EAPF) for non-static environments is presented. With the aim to accelerate the path planning computation, the EAPF ...
Optimizing feature selection through binary charged system search
(2013-09-26)
Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be inviable for a ...
Evolutionary multi-move path-relinking for transmission network expansion planning
(Ieee, 2010-01-01)
This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to ...
Environment recognition for path generation in autonomous mobile robots
(2019-11)
An efficient algorithm for path generation in autonomous mobile robots using a visual recognition approach is presented. The proposal includes image filtering techniques by employing an inspecting camera to sense a cluttered ...