The k-server problem is perhaps the most influential online problem: natural, crisp, with a
surprising technical depth that manifests the richness of competitive analysis. The k-server …

Objective A single valued neutrosophic set represented the uncertainty of real life situations
in terms of membership (t), indeterminacy (i) and non-membership (f) degree. However, this …

In the aftermath of disasters, localization of trapped victims is imperative to ensure their
safety and rescue. This article presents a novel localization and path planning approach that …

The single valued neutrosophic set (SVNS) was developed to handle uncertainty in
information depending on independent states called truth, indeterminacy and false …

We consider the framework of stochastic multi-armed bandit problems and study the
possibilities and limitations of strategies that perform an online exploration of the arms. The …

This chapter discusses Integration of Representation Into Goal-Driven Behavior-Based
Robots. The robot was tested over a period of 2 months, in over 40 trials, in a cluttered office …

We address the problem of robotic exploration of a graphlike world, where no distance or
orientation metric is assumed of the world. The robot is assumed to be able to autonomously …

We consider exploration problems where a robot has to construct a complete map of an
unknown environment. We assume that the environment is modeled by a directed, strongly …

Searching for a goal is a central and extensively studied problem in computer science. In
classical searching problems, the cost of a search function is simply the number of queries …

This paper analyzes the complexity of on-line reinforcement learning algorithms, namely
asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of …