3,374 research outputs found
Coordination of Mobile Mules via Facility Location Strategies
In this paper, we study the problem of wireless sensor network (WSN)
maintenance using mobile entities called mules. The mules are deployed in the
area of the WSN in such a way that would minimize the time it takes them to
reach a failed sensor and fix it. The mules must constantly optimize their
collective deployment to account for occupied mules. The objective is to define
the optimal deployment and task allocation strategy for the mules, so that the
sensors' downtime and the mules' traveling distance are minimized. Our
solutions are inspired by research in the field of computational geometry and
the design of our algorithms is based on state of the art approximation
algorithms for the classical problem of facility location. Our empirical
results demonstrate how cooperation enhances the team's performance, and
indicate that a combination of k-Median based deployment with closest-available
task allocation provides the best results in terms of minimizing the sensors'
downtime but is inefficient in terms of the mules' travel distance. A
k-Centroid based deployment produces good results in both criteria.Comment: 12 pages, 6 figures, conferenc
Path Planning for Cooperative Routing of Air-Ground Vehicles
We consider a cooperative vehicle routing problem for surveillance and
reconnaissance missions with communication constraints between the vehicles. We
propose a framework which involves a ground vehicle and an aerial vehicle; the
vehicles travel cooperatively satisfying the communication limits, and visit a
set of targets. We present a mixed integer linear programming (MILP)
formulation and develop a branch-and-cut algorithm to solve the path planning
problem for the ground and air vehicles. The effectiveness of the proposed
approach is corroborated through extensive computational experiments on several
randomly generated instances
Experimental Validation of a Real-Time Optimal Controller for Coordination of CAVs in a Multi-Lane Roundabout
Roundabouts in conjunction with other traffic scenarios, e.g., intersections,
merging roadways, speed reduction zones, can induce congestion in a
transportation network due to driver responses to various disturbances.
Research efforts have shown that smoothing traffic flow and eliminating
stop-and-go driving can both improve fuel efficiency of the vehicles and the
throughput of a roundabout. In this paper, we validate an optimal control
framework developed earlier in a multi-lane roundabout scenario using the
University of Delaware's scaled smart city (UDSSC). We first provide conditions
where the solution is optimal. Then, we demonstrate the feasibility of the
solution using experiments at UDSSC, and show that the optimal solution
completely eliminates stop-and-go driving while preserving safety.Comment: 6 Pages, 4 Figures, 1 tabl
- …