Path planning still remains one of the core problems in modern robotic applications, such as
the design of autonomous vehicles and perceptive systems. The basic path-planning …

We present an algorithm for solving the shortest (collision-free) path planning problem for an
agent (eg, a small UAV) with limited on-board computational resources. The agent has …

Path planning is one of the extensively studied problems in robotics, simulations and
gaming, computer graphics, very large-scale integration (VLSI), and many more. In this …

Collision-free paths in the geometric model of a protein molecule reveal various
dependencies between the structure of the molecule and its function. The paths which …

Dynamic path planning with regular triangulations Page 1 DYNAMIC PATH PLANNING WITH
REGULAR TRIANGULATIONS Petr Broz, Michal Zemek, Ivana Kolingerová, Jakub Szkandera …

Abstract Computational Geometry and Intelligent Computing are the two areas that correlate
to each other in a variety of ways. The goal of computational geometry is a two or three …

This chapter presents an application of swarm intelligence technique to simulate the
behavior of complex tactical formation of strategic missiles. The Layered Delaunay …

在路径规划中普遍采用多条短曲线拼接成一条长曲线, 这种方法通常只实现了C1 连续,
导致相邻短曲线在连接处的二阶导数不连续. 为解决这个问题, 采用具有C2 连续特点的三次B …

Computation and analysis of channels plays an important role in the process of
understanding of structure-function relationships in protein molecules. Channels–specific …

One of the biggest challenges of game development is to produce a pathfinding algorithm
that both produces satisfactory realistic movement results and can solve different scenarios …