Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Minimum Time Point Assignment for Coverage by Two Constrained Nilanjan Chakraborty
 

Summary: Minimum Time Point Assignment for Coverage by Two Constrained
Robots
Nilanjan Chakraborty
Rensselaer Polytechnic Inst.
Troy, New York 12180
chakrn2@cs.rpi.edu
Srinivas Akella
Rensselaer Polytechnic Inst.
Troy, New York 12180
sakella@cs.rpi.edu
John T. Wen
Rensselaer Polytechnic Inst.
Troy, New York 12180
wenj@rpi.edu
Abstract-- This paper focuses on the assignment of discrete
points to two robots, in the presence of geometric and kinematic
constraints between the robots. The individual points have
differing processing times, and the goal is to identify an
assignment of points to the robots so that the total processing
time is minimized. The assignment of points to the robots is

  

Source: Akella, Srinivas - Department of Computer Science, University of North Carolina, Charlotte

 

Collections: Engineering; Computer Technologies and Information Sciences