Realtime collaborating with an industrial manipulator using a constraint-based programming approach

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

6 Building Industrial Applications with Constraint Programming

In this chapter1 we will give an overview of real-life applications developed with constraint logic programming. Constraint logic programming (CLP) combines declarative logic based programming with specialised constraint solving methods from artificial intelligence, Operations Research (OR) and mathematics. It allows the clear and concise expression of a wide class of combinatorial problems tog...

متن کامل

Constraint-Based Composition in Realtime

This paper proposes an approach for constraint-based algorithmic composition in realtime. To our knowledge, constraint programming – which performs a search – has not been used for music composition in realtime before. The main contribution of this paper is a meta-solver with a timeout. We decompose the music creation process into one sub-constraint-problem and solver call per time step. The me...

متن کامل

Constraint-Based Sequence Mining Using Constraint Programming

The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a general framework is still missing. We investigate the use of constraint programming as general framework for this task. We first identify four cat...

متن کامل

An Approach to High-Level Synthesis Using Constraint Logic Programming

This paper presents a new method for modeling and solving high-level synthesis problem. In our approach, finite domain constraints and related constraints solving techniques offered by constrained logic programming are used. They make it possible to define basic constraints on operations and registers and provide a way to find optimal or sub-optimal solutions to the data-path synthesis problem....

متن کامل

Constraint-Based Sentence Compression: An Integer Programming Approach

The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an optimisation problem. We develop an integer programming formulation and infer globally optimal compressions in the face of linguistically motivated constraints. We show that such a formulation allows for relatively simp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia CIRP

سال: 2018

ISSN: 2212-8271

DOI: 10.1016/j.procir.2018.03.012