The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper addresses adaptive coverage of a spatial field without prior knowledge. Our application in this paper is to cover a region of the sea surface using a robotic boat, although the algorithmic approach has wider applicability. We propose an anytime planning technique for efficient data gathering using point-sampling based on non-uniform data-driven coverage. Our goal is to sense a particular...
This paper addresses the problem of searching multiple non-adversarial targets using a mobile searcher in an obstacle-free environment. In practice, we are particularly interested in marine applications where the targets drift on the ocean surface. These targets can be surface sensors used for marine environmental monitoring, drifting debris, or lost divers in open water. Searching for a floating...
In this paper, we examine multi-target search, where one or more targets must be found by a moving robot. Given the target's initial probability distribution or the expected search region, we present an analysis of three search strategies - Global maxima search, Local maxima search, and Spiral search. We aim at minimizing the mean-time-to-find and maximizing the total probability of finding the target...
We address the problem of rendezvous between two agents in urban street networks. Specifically, we consider the case where the agents have variable speeds and they need to schedule a rendezvous or a meeting under uncertainty in their travel times. Examples of such a scenario range from everyday life where two people would like to coordinate a meeting while going from office to home; to a futuristic...
In this paper we present an efficient method for visual mapping of open water environments using exploration and reward identification followed by selective visual coverage. In particular, we consider the problem of visual mapping a shallow water coral reef to provide an environmental assay. Our approach has two stages based on two classes of sensors: bathymetric mapping and visual mapping. We use...
In this paper, we investigate the question of how a legged robot can walk efficiently by taking advantage of its ability to alter its gait as a function of statistical (large-scale) terrain properties. One of the contributions of this paper is the algorithm to achieve real-time terrain identification and autonomous gait adaptation on a legged robot. We approach this problem by first classifying the...
In this paper we propose a design of a class of robotic legs (known as “Ninja legs”) that enable amphibious operation, both walking and swimming, for use on a class of hexapod robots. Amphibious legs equip the robot with a capability to explore diverse locations in the world encompassing both those that are on the ground as well as underwater. In this paper we work with a hexapod robot of the Aqua...
In this paper we examine the interplay between terrain classification accuracy and gait in a walking robot, and show how changes in walking speed can be used for terrain-dependent walk optimizations, as well as to enhance terrain identification. The details of a walking gait have a great influence on the performance of locomotive systems and their interaction with the terrain. Most legged robots can...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.