Energy-Based Voronoi Partition in Constant Flow Environments

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to IEEE Transactions on Automation Science and Engineering

Scientific paper

As is well known, energy cost can greatly impact the deployment of battery-powered sensor networks in remote environments such as rivers or oceans. Motivated by this, we propose here an energy-based metric and associate energy-based Voronoi partitions with mobile vehicles in constant flows. The metric corresponds to the minimum energy that a vehicle requires to move from one point to another in the flow environment, and the resulting partition can be used by the vehicles in cooperative control tasks such as task assignment and coverage. Based on disk-based and asymptote-based approximations of the Voronoi regions, we determine a subset (or lower bound) and superset (or upper bound) of an agent's Voronoi neighbors. We then show that, via simulations, the upper bound is tight and its cardinality remains bounded as the number of generators increases. Finally, we propose efficient algorithms to compute the upper bound (especially when the generators dynamically change), which enables the fast calculation of Voronoi regions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Energy-Based Voronoi Partition in Constant Flow Environments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Energy-Based Voronoi Partition in Constant Flow Environments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Energy-Based Voronoi Partition in Constant Flow Environments will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-466920

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.