• Publications
  • Influence
Information bounds and quickest change detection in decentralized decision systems
  • Yongguo Mei
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 1 July 2005
The quickest change detection problem is studied in decentralized decision systems, where a set of sensors receive independent observations and send summary messages to the fusion center, which makesExpand
A case study of mobile robot's energy consumption and conservation techniques
Mobile robots are used in many applications, such as carpet cleaning, pickup and delivery, search and rescue, and entertainment. Energy limitation is one of the most important challenges for mobileExpand
Sensor replacement using mobile robots
TLDR
This paper proposes to use a small number of mobile robots to replace failed sensors for a large-scale static sensor network and studies algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile Robots and the messaging overhead incurred to the sensor network. Expand
Deployment of mobile robots with energy and timing constraints
TLDR
A speed-management method is proposed to decide the traveling speeds to maximize the traveling distance under both energy and timing constraints, and a approach to consider areas with random obstacles is provided. Expand
Energy-efficient motion planning for mobile robots
TLDR
A new approach to find energy-efficient motion plans for mobile robots by model the relationship of motors' speed and their power consumption with polynomials and comparing the energy consumption of different routes at different velocities. Expand
Collaborative intrusion detection system (CIDS): a framework for accurate and efficient IDS
TLDR
CIDS can be used to measure the propagation time of an intrusion which is useful in choosing an appropriate response strategy and increase the accuracy of detection compared to individual detectors, without a substantial degradation in performance. Expand
Energy-efficient mobile robot exploration
TLDR
An approach for energy-efficient robot exploration that determines the next target for the robot to visit based upon orientation information and reduces repeated coverage, a common problem for most existing utility-based target selecting methods. Expand
Deployment Strategy for Mobile Robots with Energy and Timing Constraints
TLDR
A solution for the deployment problem when robots have limited energy and time to collectively accomplish coverage tasks is presented and results show that the method uses 26% fewer robots comparing with two heuristics for covering the same size of area. Expand
Repairing Sensor Network Using Mobile Robots
Sensor network repairing is important for providing continuous sensing services. Upon sensor node failures, holes (uncovered areas) may appear in the sensing coverage. Existing approaches relocateExpand
Replacing Failed Sensor Nodes by Mobile Robots
TLDR
This paper proposes to use a small number of mobile robots to replace failed sensors in a large-scale static sensor network, and studies algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile Robots and the messaging overhead incurred to the sensor network. Expand
...
1
2
...