TY - JOUR

T1 - A competitive online algorithm for exploring a solar map

AU - Plonski, Patrick A.

AU - Isler, Volkan I

PY - 2014/9/22

Y1 - 2014/9/22

N2 - In This paper, we study The problem of quickly building The 3D model of an outdoor environment from measurements obtained by a robot equipped with a solar panel. The robot knows The angle of The sun and The locations of The objects in The environment. It does not know, however, The height of The objects. For example, it might be possible To use satellite images To obtain locations of Trees in a field but not Their heights. In order To compute The height of an object, The robot must find The projection of The object's highest point. This is where The shadow of The object ends. The robot can find it by Tracing The shadow (moving parallel To The sun) until The measurement switches from shadow To sun or vice versa. The robot's goal is To compute The height of every object as quickly as possible using only solar measurements. We formulate This as an online optimization problem. The optimal offline algorithm is given by The Traveling Salesman path of The Transition points. The robot does not know These locations a priori. It must search for each of Them. We present an algorithm with The property That for n objects, our distance Traveled is guaranteed To be within a factor O(log n) of This optimal offline Tour. In addition To analytical proofs, we demonstrate The algorithm with simulations using solar data collected from field experiments, and examine its performance for uniformly distributed sites.

AB - In This paper, we study The problem of quickly building The 3D model of an outdoor environment from measurements obtained by a robot equipped with a solar panel. The robot knows The angle of The sun and The locations of The objects in The environment. It does not know, however, The height of The objects. For example, it might be possible To use satellite images To obtain locations of Trees in a field but not Their heights. In order To compute The height of an object, The robot must find The projection of The object's highest point. This is where The shadow of The object ends. The robot can find it by Tracing The shadow (moving parallel To The sun) until The measurement switches from shadow To sun or vice versa. The robot's goal is To compute The height of every object as quickly as possible using only solar measurements. We formulate This as an online optimization problem. The optimal offline algorithm is given by The Traveling Salesman path of The Transition points. The robot does not know These locations a priori. It must search for each of Them. We present an algorithm with The property That for n objects, our distance Traveled is guaranteed To be within a factor O(log n) of This optimal offline Tour. In addition To analytical proofs, we demonstrate The algorithm with simulations using solar data collected from field experiments, and examine its performance for uniformly distributed sites.

UR - http://www.scopus.com/inward/record.url?scp=84929207505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929207505&partnerID=8YFLogxK

U2 - 10.1109/ICRA.2014.6907706

DO - 10.1109/ICRA.2014.6907706

M3 - Conference article

AN - SCOPUS:84929207505

SP - 5766

EP - 5771

JO - Proceedings - IEEE International Conference on Robotics and Automation

JF - Proceedings - IEEE International Conference on Robotics and Automation

SN - 1050-4729

M1 - 6907706

T2 - 2014 IEEE International Conference on Robotics and Automation, ICRA 2014

Y2 - 31 May 2014 through 7 June 2014

ER -