Sökning: "robot search"
Visar resultat 16 - 20 av 45 avhandlingar innehållade orden robot search.
16. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem
Sammanfattning : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. LÄS MER
17. Robots That Understand Natural Language Instructions and Resolve Ambiguities
Sammanfattning : Verbal communication is a key challenge in human-robot interaction. For effective verbal interaction, understanding natural language instructions and clarifying ambiguous user requests are crucial for robots. In real-world environments, the instructions can be ambiguous for many reasons. LÄS MER
18. Modeling and Control of Stiff Robots for Flexible Manufacturing
Sammanfattning : To survive on a global market, small and medium size enterprises (SMEs) require affordable and competitive industrial automation for high quality flexible manufacturing. This thesis contributes to the development of robot concepts that fit the needs of SMEs. LÄS MER
19. Control of Dynamical Systems subject to Spatio-Temporal Constraints
Sammanfattning : Over the last decades, autonomous robots have been considered in a variety of applications such as persistent monitoring, package delivery and cooperative transportation. These applications often require the satisfaction of a set of complex tasks that need to be possibly performed in a timely manner. LÄS MER
20. Combining Task and Motion Planning
Sammanfattning : This thesis addresses the problem of automatically computing, given a high-level goal description, a sequence of actions and motion paths for one or several robots to achieve that goal. Also referred to as CTAMP (Combining Task And Motion Planning), this problem may seem trivial at first glance, since efficient solutions have been found for its two underlying problems, namely task planning and motion planning. LÄS MER