We consider the problem in which n items arrive to a market sequentially over time, where two agents compete choose best possible item. When an agent selects item, he leaves and obtains payoff given by value of is represented random variable following known distribution with support contained [0,1]. different settings for this problem. In first one, namely competitive selection no recall, obser...

Robot navigation is a fundamental problem in robotics. Navigation associated to mobile robot is the problem of finding a feasible path form one configuration to another by avoiding the obstacles along its path. Various approaches have been developed to cope with this problem and still researchers are keen to develop the new techniques which would make the process smoother and faster. Selection ...

In this work, we focus on the problem of object location and recognition by an autonomous mobile robot. In our approach, the robot does not have any prior knowledge about the form and multiplicity of the objects. The robot, however, is equipped with an onboard camera and both objects and robot are capable of exchanging data by using a common low-cost, low-rate wireless technology, namely a Tmot...

The problem of learning a policy, a task representation mapping from world states to actions, lies at the heart of many robotic applications. One approach to acquiring a task policy is learning from demonstration, an interactive technique in which a robot learns a policy based on example state to action mappings provided by a human teacher. This thesis introduces Confidence-Based Autonomy, a mi...