2020 (vol. 30) - Number 4
A.B. Malinowska, R. Kamocki, R. Almeida, T. Odzijewicz:
On the existence of optimal consensus control for the fractional Cucker--Smale model
R. Grymin, W. Bożejko, J. Pempera, M. Wodecki, Z. Chaczko:
Algorithm for solving the Discrete-Continuous Inspection Problem
T. Kaczorek, A. Ruszewski:
Global stability of discrete-time nonlinear systems with descriptor standard and fractional positive linear parts and scalar feedbacks
R. Arora, K. Gupta:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
P. Nowak, J. Czeczot, P. Grelewicz:
Tuning rules for industrial use of the second-order Reduced Active Disturbance Rejection Controller
M.I. Gomoyunov:
Optimal control problems with a fixed terminal time in linear fractional-order systems
Muhafzan, A. Nazra, L. Yulianti, Zulakmal, R. Revina:
On LQ optimization problem subject to fractional order irregular singular systems
M. Blizorukova, V. Maksimov:
On one algorithm for reconstruction of an disturbance in a linear system of ordinary differential equations
ACS Abstract:
Number 2
Constraint satisfaction techniques in planning and scheduling: An introduction

R. Bartak (Charles University, Czech Republic) |
keywords: constraint satisfaction, problem modeling, planning, scheduling
Filtering algorithms for the unary resource constraint

P. Vilim (ILOG S.A., Gentilly Cedex, France) |
keywords: constraint programming, scheduling, optional activities, unary resource, filtering algorithms
Modification strategies for SAT-based plan adaptation

R. van der Krogt (Cork Constraint Computation Centre, University College Cork, Ireland) |
This paper investigates a plan adaptation framework based on SAT-encodings of the planning problem. Compilation techniques have been very successfully applied to planning, as evidenced by their success in recent planning competitions. So far, however, such techniques have not been used for plan adaptation purposes. This paper explores whether it is feasible to modify the generated SAT instances such as to encode information that was extracted from the solution to the original planning problem.
keywords: plan repair, planning as satisfiability
Unifying planning and scheduling as timelines in a component-based perspective

F. Pecora (AASS Mobile Robotics Lab, Orebro University, Sweden) | S. Fratini (ISTC-CNR,National Research Council of Italy) | A. Cesta (ISTC-CNR,National Research Council of Italy) |
The rationale behind the component-based approach shares with classical control theory a basic modeling perspective: the planning and scheduling problem is represented by identifying a set of relevant domain components which need to be controlled to obtain a desired temporal behavior for the entire system. Components are entities whose properties may vary in time and which model one or more physical (or logical) domain subsystems relevant to a given planning context. The planner/scheduler plays the role of the controller for these entities, and reasons in terms of constraints that bound their internal evolutions and the desired properties of the generated behaviors (goals).
Our work complements this modeling assumption with a constraint-based computational framework. Admissible temporal behaviors of components are specified as a set of causal constraints within a rich temporal specification, and goals are specified as temporal constraint preferences. The OMPS software architecture presented in this paper combines both specific and generic constraint solvers in defining consistent timelines which satisfy a given set of goals.
keywords: planning, scheduling, timelines
<< Back