Abstract: In this paper, we study the Minimum Latency Broadcast
Scheduling (MLBS) problem in wireless sensor networks (WSNs).
The main issue of the MLBS problem is to compute schedules
with the minimum number of timeslots such that a base station can
broadcast data to all other sensor nodes with no collisions. Unlike
existing works that utilize the traditional omni-directional WSNs,
we target the directional WSNs where nodes can collaboratively
determine and orientate their antenna directions. We first develop
a 7-approximation algorithm, adopting directional WSNs. Our ratio
is currently the best, to the best of our knowledge. We then validate
the performance of the proposed algorithm through simulation.
Abstract: In this paper, we study the data collection problem in
Wireless Sensor Networks (WSNs) adopting the two interference
models: The graph model and the more realistic physical interference
model known as Signal-to-Interference-Noise-Ratio (SINR). The
main issue of the problem is to compute schedules with the minimum
number of timeslots, that is, to compute the minimum latency
schedules, such that data from every node can be collected without
any collision or interference to a sink node. While existing works
studied the problem with unit-sized and unbounded-sized message
models, we investigate the problem with the bounded-sized message
model, and introduce a constant factor approximation algorithm.
To the best known of our knowledge, our result is the first result
of the data collection problem with bounded-sized model in both
interference models.
Abstract: This paper presents a set of artificial potential field functions that improves upon, in general, the motion planning and posture control, with theoretically guaranteed point and posture stabilities, convergence and collision avoidance properties of 3-trailer systems in a priori known environment. We basically design and inject two new concepts; ghost walls and the distance optimization technique (DOT) to strengthen point and posture stabilities, in the sense of Lyapunov, of our dynamical model. This new combination of techniques emerges as a convenient mechanism for obtaining feasible orientations at the target positions with an overall reduction in the complexity of the navigation laws. The effectiveness of the proposed control laws were demonstrated via simulations of two traffic scenarios.
Abstract: In this paper, we propose a solution to the motion
planning and control problem for a swarm of three-dimensional
boids. The swarm exhibit collective emergent behaviors within the
vicinity of the workspace. The capability of biological systems
to autonomously maneuver, track and pursue evasive targets in a
cluttered environment is vastly superior to any engineered system. It
is considered an emergent behavior arising from simple rules that are
followed by individuals and may not involve any central coordination.
A generalized, yet scalable algorithm for attraction to the centroid
and inter-individual swarm avoidance is proposed. We present a set
of new continuous time-invariant velocity control laws, formulated via
the Lyapunov-based control scheme for target attraction and collision
avoidance. The controllers provide a collision-free trajectory. The
control laws proposed in this paper also ensures practical stability
of the system. The effectiveness of the control laws is demonstrated
via computer simulations.
Abstract: This paper considers the design of a motion planner
that will simultaneously accomplish control and motion planning of a
n-link nonholonomic mobile manipulator, wherein, a n-link
holonomic manipulator is coupled with a nonholonomic mobile
platform, within an obstacle-ridden environment. This planner,
derived from the Lyapunov-based control scheme, generates
collision-free trajectories from an initial configuration to a final
configuration in a constrained environment cluttered with stationary
solid objects of different shapes and sizes. We demonstrate the
efficiency of the control scheme and the resulting acceleration
controllers of the mobile manipulator with results through computer
simulations of an interesting scenario.
Abstract: A procedural-animation-based approach which rapidly
synthesize the adaptive locomotion for quadruped characters that they
can walk or run in any directions on an uneven terrain within a
dynamic environment was proposed. We devise practical motion
models of the quadruped animals for adapting to a varied terrain in a
real-time manner. While synthesizing locomotion, we choose the
corresponding motion models by means of the footstep prediction of
the current state in the dynamic environment, adjust the key-frames of
the motion models relying on the terrain-s attributes, calculate the
collision-free legs- trajectories, and interpolate the key-frames
according to the legs- trajectories. Finally, we apply dynamic time
warping to each part of motion for seamlessly concatenating all desired
transition motions to complete the whole locomotion. We reduce the
time cost of producing the locomotion and takes virtual characters to
fit in with dynamic environments no matter when the environments are
changed by users.
Abstract: Finding the shortest path between two positions is a
fundamental problem in transportation, routing, and communications
applications. In robot motion planning, the robot should pass around
the obstacles touching none of them, i.e. the goal is to find a
collision-free path from a starting to a target position. This task has
many specific formulations depending on the shape of obstacles,
allowable directions of movements, knowledge of the scene, etc.
Research of path planning has yielded many fundamentally different
approaches to its solution, mainly based on various decomposition
and roadmap methods. In this paper, we show a possible use of
visibility graphs in point-to-point motion planning in the Euclidean
plane and an alternative approach using Voronoi diagrams that
decreases the probability of collisions with obstacles. The second
application area, investigated here, is focused on problems of finding
minimal networks connecting a set of given points in the plane using
either only straight connections between pairs of points (minimum
spanning tree) or allowing the addition of auxiliary points to the set
to obtain shorter spanning networks (minimum Steiner tree).
Abstract: This paper presents a method to support dynamic
packing in cases when no collision-free path can be found. The
method, which is primarily based on path planning and shrinking of
geometries, suggests a minimal geometry design change that results
in a collision-free assembly path. A supplementing approach to
optimize geometry design change with respect to redesign cost is
described. Supporting this dynamic packing method, a new method
to shrink geometry based on vertex translation, interweaved with
retriangulation, is suggested. The shrinking method requires neither
tetrahedralization nor calculation of medial axis and it preserves the
topology of the geometry, i.e. holes are neither lost nor introduced.
The proposed methods are successfully applied on industrial
geometries.
Abstract: This paper considers the autonomous navigation
problem of multiple n-link nonholonomic mobile manipulators within
an obstacle-ridden environment. We present a set of nonlinear
acceleration controllers, derived from the Lyapunov-based control
scheme, which generates collision-free trajectories of the mobile
manipulators from initial configurations to final configurations in a
constrained environment cluttered with stationary solid objects of
different shapes and sizes. We demonstrate the efficiency of the
control scheme and the resulting acceleration controllers of the
mobile manipulators with results through computer simulations of an
interesting scenario.
Abstract: This paper presents a new sensor-based online method for generating collision-free near-optimal paths for mobile robots pursuing a moving target amidst dynamic and static obstacles. At each iteration, first the set of all collision-free directions are calculated using velocity vectors of the robot relative to each obstacle and target, forming the Directive Circle (DC), which is a novel concept. Then, a direction close to the shortest path to the target is selected from feasible directions in DC. The DC prevents the robot from being trapped in deadlocks or local minima. It is assumed that the target's velocity is known, while the speeds of dynamic obstacles, as well as the locations of static obstacles, are to be calculated online. Extensive simulations and experimental results demonstrated the efficiency of the proposed method and its success in coping with complex environments and obstacles.