welcome: please sign in
location: Diff for "ProblemsDescription/PartnerUnits"
Differences between revisions 1 and 2
Revision 1 as of 2011-01-05 15:17:36
Size: 1142
Comment:
Revision 2 as of 2011-01-10 10:23:39
Size: 1227
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:

<<TableOfContents>>
Line 18: Line 20:
== Input format ==

== Output format ==

== Example ==

Partner Units

Problem description

Partner unit problem describes a people counting system.

The problem includes three types of components, namely a door sensor, a zone and a communication unit. The problem requirements are:

  1. Each zone as well as each door sensor must be connected to exactly one unit;
  2. Each unit can control at most two door sensors and at most two zones;
  3. If a unit controls a door sensor that contributes to a zone controlled by another unit, then the two units must be connected directly, i.e. one unit becomes a partner unit of the other and vice versa;
  4. Each unit can have at most maxPU partner units which is constant for each problem instance.

The solution of the partner unit problem is defined as follows:

  • Given a consistent configuration of door sensors and zones, a number of available units lower and a constant maxPU, find a valid assignment of units that satisfies all requirements.

Input format

Output format

Example

Author(s)

  • Anna Ryabokon
    • Alpen-Adria University, Austria
  • Andreas Falkner
    • Siemens AG
  • Gerhard Friedrich
    • Alpen-Adria University, Austria

ASP Competition 2011: ProblemsDescription/PartnerUnits (last edited 2011-01-10 10:23:39 by CarmenSantoro)