Computational Intelligence - November 2013 - 19
The careful reader should note that due to the
The attainment of the mission's goals requires the
stepwise segmentation of the power production
profile, possible overloads on the imposition of
use of the rover's set of instruments/resources whose
precedence constraints during the battery conutilization must be synchronized over time in order to
tention peaks resolution might occur. In order to
guarantee the correct execution of the plan's activities.
overcome with such limitations, conflicts are
solved in only one step by analyzing the (continuous) realistic power production profile such that
the separation constraints are weighted with a time value equal
to the time required to recover all the (over)demanded energy
Drilli
Navi, F
Reli
by the subscribing activities.
Finally, it is worth pointing out that due to the specific
Drillj
Navj, F
Relj
characteristics of our MSR scheduling model, the imposi(a)
tions of the temporal constraints during the solving process
Reli
Drilli
Navi, F
might lead to particular deadlock combinations (or crossed
constraint situations, initially described in [21]), and hence
Drillj
Navj, F
Relj
originate unsolvable MCSs. Figure 5 exemplifies the prob(b)
lem by providing three deadlock instances originating from
different solving constraint combinations in a simple probDrilli
Navi, F
Reli
lem instance composed of two jobs. As the figure shows, in
all the three cases (a), (b) and (c), the imposed constraints
Drillj
Navj, F
Relj
(thick arrows) define such an ordering between the Drill i
(c)
and the Rel j activities that the two navigation activities
Nav i, F and Nav j, F can no longer be separated.
Figure 5 Three different examples of deadlock situations with two
Obviously, this circumstance represents a deadlock if the
rover experiments, and maximum battery capacity C = 1.
maximum capacity C of the sample cache is equal to 1, as
this condition forbids any two navigation activities to be
Algorithm 2: The iterative sampling search framework (ISES)
scheduled concurrently. By visually inspecting Figure 5, it
for solution optimization.
can be noted that a possible occurrence of a deadlock situaInput: Problem, MaxH, MaxTime, MaxAttempts
tion is related to the existence of a constraint cycle among the
problem sequences (e.g., in all cases, the first constraint links
Output: S best
sequence i with sequence j and the second constraint links
1 S best ! ESTA p (MaxH)
sequence j with sequence i, thus forming a cycle of length
2 while (J StopCondition (MaxTime,
2). Among all combinations, the type of ordering relations
MaxAttempts)) do
p
that can possibly originate cycles (i.e., the necessary condition
3
Sol ! ESTA rand ^ MK ^ S best hh
for a deadlock), are the Drill i ' Drill j, the Drill i ' Rel j, and
4
if (Mk (sol)
Table of Contents for the Digital Edition of Computational Intelligence - November 2013
Computational Intelligence - November 2013 - Cover1
Computational Intelligence - November 2013 - Cover2
Computational Intelligence - November 2013 - 1
Computational Intelligence - November 2013 - 2
Computational Intelligence - November 2013 - 3
Computational Intelligence - November 2013 - 4
Computational Intelligence - November 2013 - 5
Computational Intelligence - November 2013 - 6
Computational Intelligence - November 2013 - 7
Computational Intelligence - November 2013 - 8
Computational Intelligence - November 2013 - 9
Computational Intelligence - November 2013 - 10
Computational Intelligence - November 2013 - 11
Computational Intelligence - November 2013 - 12
Computational Intelligence - November 2013 - 13
Computational Intelligence - November 2013 - 14
Computational Intelligence - November 2013 - 15
Computational Intelligence - November 2013 - 16
Computational Intelligence - November 2013 - 17
Computational Intelligence - November 2013 - 18
Computational Intelligence - November 2013 - 19
Computational Intelligence - November 2013 - 20
Computational Intelligence - November 2013 - 21
Computational Intelligence - November 2013 - 22
Computational Intelligence - November 2013 - 23
Computational Intelligence - November 2013 - 24
Computational Intelligence - November 2013 - 25
Computational Intelligence - November 2013 - 26
Computational Intelligence - November 2013 - 27
Computational Intelligence - November 2013 - 28
Computational Intelligence - November 2013 - 29
Computational Intelligence - November 2013 - 30
Computational Intelligence - November 2013 - 31
Computational Intelligence - November 2013 - 32
Computational Intelligence - November 2013 - 33
Computational Intelligence - November 2013 - 34
Computational Intelligence - November 2013 - 35
Computational Intelligence - November 2013 - 36
Computational Intelligence - November 2013 - 37
Computational Intelligence - November 2013 - 38
Computational Intelligence - November 2013 - 39
Computational Intelligence - November 2013 - 40
Computational Intelligence - November 2013 - 41
Computational Intelligence - November 2013 - 42
Computational Intelligence - November 2013 - 43
Computational Intelligence - November 2013 - 44
Computational Intelligence - November 2013 - 45
Computational Intelligence - November 2013 - 46
Computational Intelligence - November 2013 - 47
Computational Intelligence - November 2013 - 48
Computational Intelligence - November 2013 - 49
Computational Intelligence - November 2013 - 50
Computational Intelligence - November 2013 - 51
Computational Intelligence - November 2013 - 52
Computational Intelligence - November 2013 - 53
Computational Intelligence - November 2013 - 54
Computational Intelligence - November 2013 - 55
Computational Intelligence - November 2013 - 56
Computational Intelligence - November 2013 - 57
Computational Intelligence - November 2013 - 58
Computational Intelligence - November 2013 - 59
Computational Intelligence - November 2013 - 60
Computational Intelligence - November 2013 - 61
Computational Intelligence - November 2013 - 62
Computational Intelligence - November 2013 - 63
Computational Intelligence - November 2013 - 64
Computational Intelligence - November 2013 - Cover3
Computational Intelligence - November 2013 - Cover4
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202311
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202308
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202305
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202302
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202211
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202208
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202205
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202202
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202111
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202108
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202105
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202102
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202011
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202008
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202005
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202002
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201911
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201908
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201905
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201902
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201811
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201808
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201805
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201802
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter12
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall12
https://www.nxtbookmedia.com