An Online Algorithm for Improving Performance in Navigation

DOI10.1137/S0097539795290593zbMath0953.68061arXivmath/9409224OpenAlexW2132529817MaRDI QIDQ4507331

Prasad Chalasani, Avrim L. Blum

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9409224

zbMATH Keywords

navigationlearningcompetitive analysisonline algorithmslower boundsrobot path planningexploration vs.\ exploitationunfamiliar terrain

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Online makespan minimization with parallel schedules ⋮ Online algorithms for searching and exploration in the plane ⋮ COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS