A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

In this article, an effective solution is presented for efficient robotic object search by
leveraging metric-topological map. Based on the reference of objects, we construct a novel …

The growth in usage of efficient mobile robots in engineering has motivated the search for
new alternatives to improve the control tuning task. In this article, Cartesian space …

Metaheuristics are truly diverse in nature—under the overarching theme of performing
operations to escape local optima, algorithms as different as ant colony optimization, tabu …

Aiming at the problems of the basic ant colony algorithm in path planning, such as long
convergence time, poor global path quality and not being suitable for dynamic environments …

The current society requires solutions for many problems in safety, economy, and health.
The social concerns on the high rate of repetitive strain injury, work-related osteomuscular …

Track guidance vehicle (RGV) is widely used in logistics warehousing and intelligent
workshop, and its scheduling effectiveness will directly affect the production and operation …

Assume a robot operating in a public space (eg, a library, a museum) and serving visitors as
a companion, a guide or an information stand. To do that, the robot has to interact with …

The traveling delivery person problem (TDP) is a customer-oriented modification of the
traveling salesperson problem, which minimizes the sum of delivery times at clients' …

Despite the importance of honeybees as pollinators for the entire ecosystem and their recent
decline threatening agricultural production, the dynamics of the living colony are not well …