Scheduling for HumanMultirobot Supervisory Control Sandra Mau Committee: John Dolan Illah Nourbakhsh Kristen Stubbs April 30, 2007 In partial fulfilment of Masters degree requirements

Overview • • • •

Multirobot Supervisory Control Problem #1: Scheduling Problem #2: Max team size Application to human multirobot interaction

2/40

Supervisory Multirobot Supervisory Control Control Telerobotics • Low-level human control • One human, one robot

Supervisory Control • High level human control • Partial robot autonomy • One human, many robots

Full Autonomy • Autonomous robot control • No humans, many, many robots

Sliding Autonomy Scale

1 Increasing Robot-to-Human Ratio



3/40

Military: Demining Area Prospecting and Planetary Exploration

Trestle - Autonomous Assembly by Teams of Coordinated Robots

Urban Search and Rescue

Example: Area Prospecting

x

x

x

x

Human task queue

Robot 1

Robot 2

Robot 4

Robot 3

5/40

Problem #1

If more than one robot requires human attention at the same time, which robot would you address first?

Downtime • Human tasks are precedence constraints for the robots’ remaining tasks • The time when the robot is waiting for the human to finish its task is downtime Robot 1 downtime Robot 2 downtime

7/40

Related Work Scheduling for Multirobot Supervisory Control • No research comparing algorithms • Study on human management issues for multiple UAVs [Cummings and Mitchell 05] – humans are bad at planning given: • many complex possibilities • an increased workload

– suggests more guidance (e.g., scheduling) for humans

8/40

Scheduling terms defined • Release time (denoted by r) – The time at which a task is added to the queue

• Task length (denoted by a) – The time required to process a task

• Interaction Time (denoted by IT) – Human task length – Amount of time robots require human attention

• Neglect Time (denoted by NT) – Amount of time the robots will run autonomously

9/40

Existing On-line Scheduling Algorithms • Shortest Processing Time (SPT) a1 <= a2 <= …<= an , where a is the task length

– If all tasks arrive simultaneously, mean and max downtime per task, and total downtime is minimized – But tasks do NOT occur simultaneously when on-line

• Shifted SPT (SSPT) r1+a1 <= r2+a2 <=…<= rn+an , where r is when task is released (added to queue) – On-line heuristic which incorporates release time – Sub-optimal

• First in First Out (FIFO) r1<=r2<=…<=rn

– Minimizes maximum downtime per task – Might have poor average behaviour

10/40

Goal • An on-line scheduling algorithm which prioritizes tasks for the human supervisor to lower downtime such that the robots can return to autonomy, and its own tasks, sooner.

11/40

Limiting the Scope: Assumptions • All tasks have equal priority • Each human task is independent of others • Tasks are semi-preemptive (can be interrupted, but not resumable) • In simulations, task lengths are assumed accurate

12/40

Derivation of dSSPT: 2 robots R1: a1=10 R2: a2=7

t=0

t=0

R1: a1=10 R2: a2=7

t=2

R1: a1=10 R2 waits

R2: a2=7

t=0 Total downtime = 27

R1 waits R2: a2=7

t=0

R2: a2=7

t=2 Total downtime = 25

R1: a1=10

t=0 Total downtime = 24

R1: a1=10 R2 waits

t=0

R1 waits R2: a2=7

R1: a1=10

t=2 Total downtime = 26

If a2+2∆t < a1 is true, then swap R2 before R1. ∆t is the difference between the release times. 13/40

Derivation of dSSPT: 3 or more robots If an+2∆t < an-1 is true, then swap Rn before Rn-1

∆t = release time of R3 –start time of R2, where start time of R2 = later of(when R1 ends, when R2 is released)

14/40

dSSPT Algorithm ~ O(n) • Given a new task j, and an existing task in the list i (with ri ≤ rj), do pair-wise comparisons down the list according to the following: double of SSPT comparison (thus dSSPT) If a j + 2∆t < ai is true, 0 , if i ≥ 2 ⎫⎪ ⎧⎪ where ∆t = ⎨ ⎬ r max ( a , r ) , otherwise − 0 i ⎩⎪ j ⎭⎪ then swap tasks i and j. Do this for tasks i = j − 1, j − 2,..., 2,1

SPT SSPT variant

15/40

Human Scheduling Experiment • Tasks generated based on variables of: – Interaction Time (human task lengths) • Random variable drawn from ~N({mean,var}) where (mean,var) is drawn uniformly from a set of 3 possible lengths representing short, medium and long tasks. For example, {(5, 3),(25,3),(45,3)}

Short

Medium

Long

Task length

• 2 types of variance: Variance in mean and distribution about mean

– Number of robots on the team 16/40

Results: Downtime

• No variance in IT means no downtime improvement • More variance in IT, the more improvement over FIFO • When tasks get very large, schedule is dense and SPT approaches (but does not beat) dSSPT in terms of downtime

Simulation of Human-Supervised Multirobot Area Prospecting

• When robot finds a mineral patch, he refers to the human to note it • Robot task allocation modes – Reallocatable between robots (can reallocate areas to other robots) – Non-reallocatable (cannot reallocate areas) 18/40

Simulation Results: Downtime Without Reallocation

With Reallocation

Means

• Same superior downtime performance

Ratios

Sample experiment on 50x50 map, periodic tasks, homogenous velocity of 1m/s, mean IT of 5, 25 or 45

Simulation Results: Human tasks finished over time Without Reallocation

With Reallocation

# of Robots 2 4

Means

6

• As team size increases, the performance of dSSPT over 8 FIFO becomes more pronounced • 10dSSPT always beats FIFO 12 14 16

Ratios

18 20 20/40

Simulation Results: Area Coverage # of Robots

Without Reallocation

With Reallocation

2 4

Means

• 6As team size increases, more area is covered sooner • 8As team size increases, the performance of dSSPT over FIFO becomes more pronounced 10 • dSSPT always beats FIFO with robot task reallocation 12 • FIFO sometimes beats dSSPT towards the end of the 14mission if no robot task reallocation 16

Ratios

18 20 21/40

Summary of findings in this half • Downtime occurs with variance in IT • dSSPT outperforms FIFO, SPT and SSPT in terms of lower downtime • dSSPT allows more human tasks completed sooner compared to FIFO • dSSPT usually outperforms FIFO in terms of faster area coverage

22/40

But… Is it optimal to have 20 robots on a team for those problems? Why not 100? Why not 1000? The time it takes to complete the mission would still be the same since the human’s tasks would be the bottleneck (human saturation)

23/40

Problem #2

How many robots can one human handle?

Goals • Determine what factors affect saturation team size

25/40

Human Multirobot Interaction Terms • Neglect Time (NT) – average amount of time the robots run on their own

• Interaction Time (IT) – human task length – average amount of time robots require human attention

26/40

Multirobot Supervisory Control Telerobotics • Low-level human control • One human, one robot

Supervisory Control • High level human control • Partial robot autonomy • One human, many robots

Full Autonomy • Autonomous robot control • No humans, many, many robots

Sliding Autonomy Scale

Increasing NT/IT Ratio 1 NT = 0 IT = ∞

Increasing Robot-to-Human Ratio



NT = ∞ IT = 0

27/40

Fan-Out • Fan-Out (FO) equation to define feasible team size for supervised multirobot teams : [Goodrich and Olsen 03]

4 Neglect Time

Interaction Time

Interaction Time of 4 other robots

In other words: A team should be of a size such that, on average, only one robot will require human attention at any given time. 28/40

Limitations of Fan-Out • Based on averages for NT & IT • Assumes infinite time horizon Infinite – task never addressed Finite – task eventually addressed

• Assumes all the robots on the team are homogeneous – [Crandall 05] extends the idea to a feasibility test for heterogeneous teams that is also based on averages 29/40

Revisiting Area Prospecting Simulation: Parameters • Map area • Mineral density • Mineral distribution (random or uniform) – Variance in NT

• Mineral interaction time – Random variable from ~N({mean,var}) Short

Medium

Long

Task length

• Robot velocities (homogeneous, heterogeneous) • Number of robots 30/40

Human Saturation Point • Saturation point in terms of area prospecting parameters given uniform mineral distribution & non-varying IT: • Neglect time in terms of prospecting parameters: • Same as the upper bound of fan-out! 31/40

Saturation: Baseline (No variance in NT, or IT) Fan-Out Predicted Saturation at 72/3 Robots

Saturation Point at 8 Robots

32/40

Saturation: Non-zero variance, Aperiodic Tasks • Vary IT • Vary NT – Randomness of task occurrence – Different robot velocities (homogeneity)

• Only robot task reallocation mode considered (closer to theoretical Fan-Out)

33/40

Saturation: Human Completion Time

Baseline Varying IT

Varying NT Homogeneous vs. Heterogeneous

34/40

Explanation of Saturation • Difference in saturation team size due to idle time between human tasks Ideal

Idle time

Vary NT Vary IT

• Saturation occurs when little to no idle time left • More robots mean more mineral tasks found earlier, which reduces human idle time 35/40

Benefits and Drawbacks to Teamsize • Benefits to larger teamsize: – Higher area coverage rate – More task revealed early on

• Drawbacks to larger teamsize: – Same min makespan (human saturation) – More robots (resources) used

• Depends on your mission objective and resources 36/40

Summary of Findings • General factors that affect maximum team size – Variance in NT (e.g., velocity, randomness) – Variance in IT (e.g., tasks of different lengths) – Scheduling algorithm

• Actual maximum team size will be larger than Fan-Out prediction for any real situation • Other findings: Monitoring tasks performed in each NT period over time is a good gauge of whether a human supervisor is saturated. It is also potentially a good method for doing dynamic team sizing 37/40

How Findings can be Applied in General • If you have a better scheduling algorithm, you can better utilize human time • Maximum team size estimates based on averages are too conservative • Being aware of how the use of human time effects team performance in multirobot supervisory control and formalizing the way we look at it

38/40

Future Work • Human user trials • Dynamic team-sizing experiments • Centralized scheduler for both the human and the multirobot team

39/40

Acknowledgements • Advisor: John Dolan • Committee: Kristen Stubbs, Illah Nourbakhsh • T-SAR Lab & Prospect Team: Gregg Podnar, Alan Guisewite, Ben Brown, Marcel Bergerman, Luis Navarro, Ehud Halberstam, Ellie Lin, Steve Stancliff, Jeff Baker, Ron Conescu • Family and friends 40/40

References •

• •

• •

Cummings, M. L., Mitchell, P. M., "Management of Multiple Dynamic Human Supervisory Control Tasks for UAVs", Paper to be presented at the Human Computer Interaction International Human Systems Integration Conference, Las Vegas, by invitation, 2005. MacCarthy, B.; Wilson, J.; Crawford, S.(2001)., "Human Performance in Industrial Scheduling: A Framework for Understanding", Human Factors and Ergonomics in Manufacturing, Vol.11 (4), pp.286-307. Hua, S. and Qu, G. 2003. A New Quality of Service Metric for Hard/Soft Real-Time Applications. In Proceedings of the international Conference on information Technology: Computers and Communications (April 28 30, 2003). ITCC. IEEE Computer Society, Washington, DC, 347. X. Lu, RA Sitters, L. Stougie, “A class of on-line scheduling. algorithms to minimize total completion time,” Oper. Res. Lett. 31 (2003) 232–236. D. Olsen and M. Goodrich, "Metrics for evaluating human-robot interactions," in Proc. NIST Performance Metrics for Intelligent Systems, Sep 2003.

41/40

EXTRAS

42/40

Invisible outline • • • •

Motivation/applications (what problems Scope (in terms of sliding autonomy) Scheduling examples (objective…common objectives in supervisory control) Contributions – –



Algorithm Looking at span-of-control issue

Related work in scheduling for supervisory control – –

Job shop scheduling is an NP hard problem, etc. Introduce/define terms here (IT, NT, etc.)



Why downtime metric is very appropriate for supervisory control



Summary of results:

• •

Talk about the simulations/experiments, etc. (from the first paper and maybe area coverage from the second paper) However, we know that there is a limit on how many robots a human can “effectively” control. I’ll define effectively in a minute. What I mean by that is an infinite number of robots can cover an area instantaneously. We want to evaluate/compare these algorithms in for team sizes are that make sense.



Fanout

– –

– – – – –

• • • • • •

Talk a little bit about different metrics Will present an algorithm that attempts to minimize downtime, which will show benefits in area coverage rate, etc.

Talk about the concept of span-of-control Explain How it’s suggested as a metric How it’s equivalent to saturation and describe what saturation is Implications of saturation on human user

What we expected based on the equation suggested and what we actually saw. Explain the analysis on what assumptions were explicit and implicit and why they are limiting/not applicable to real-life situations Explain how various factors affect fan-out Compare fan-out of dsspt vs FIFO and talk about the benefits and drawbacks of having more robots on a team Reframe what Fanout as a min. Wrap up by restating contributions

43/40

Summary

No vary NT

Vary NT

No vary IT

Vary IT

-No change in downtime -No change in span-of-control -No change in downtime -Change in span-of-control

-Change in downtime -Change in span-of-control -Change in downtime -Change in span-of-control 44/40

Other possible metrics to look at • Depending on mission objectives, talk about other scheduling with precedence constraints – Min completion time (makespan) [Sellner]

45/40

Other Related Work • Scheduling for Industrial Supervisory Control and Computer Networks – History of human factors planning and scheduling since the 1960’s [MacCarthy et al. 01] • knowledge in this field is still lacking • no methodical process of designing an effective supervisory control system exists

– Algorithms for Flow Time Scheduling [Bansal 03] 46/40

Results: Human tasks completed for team size of 25

• More tasks completed sooner using dSSPT than FIFO • More tasks completed sooner using dSSPT compared to an average estimate (avg frequency/avg task length)

47/40

Results: Downtime • IT with mean 15 s and variance of 6 had up to ~40% improvement over FIFO • Improvement saturates at around 17 robot tasks

48/40

Saturation: NT/IT • Video?

49/40

Simulation in HMRI Terms and how it Relates to Fan-Out •

Neglect Time – length of expected robot autonomy periods



Min Mission Completion Times – expected time for mission completion given completely even distribution of minerals and no overlap of human tasks (perfectly ideal distribution)

50/40



Human Saturation (minimum human completion time) – amount of time to address mineral tasks given no idle time between tasks



Point where min mission completion time and min human completion time meet is going to be the minimum saturation point which would result from a perfectly ideal distribution of mineral tasks Recall:

Same as the upper bound of fan-out! 51/40

Scheduling for Human- Multirobot Supervisory Control

April 30, 2007. In partial fulfilment of Masters degree requirements ..... each NT period over time is a good gauge of whether a human supervisor is ... the Human Computer Interaction International Human Systems. Integration ... on information Technology: Computers and Communications (April 28 -. 30, 2003). ITCC.

5MB Sizes 2 Downloads 46 Views

Recommend Documents

Low Cost Two-Person Supervisory Control for Small ...
Jun 1, 2013 - Associate Chair of the Masters of Aeronautical Science Degree ..... The following acronyms and abbreviations are used within this document.

Supervisory Pressure Control Report D2.6
MONITOR ... from a tool that will identify the best zone configuration for any network which can be linked to ... distribution network in a supervisory control system.

Specifying State-Based Supervisory Control ...
Plant in state: Door Open IMPLIES Plant in state: Car Standing Still. For the existing state-based supervisory controller synthesis tool we cannot use this as input,.

Decentralized Supervisory Control with Conditional ...
(e-mail: [email protected]). S. Lafortune is with Department of Electrical Engineering and. Computer Science, The University of Michigan, 1301 Beal Avenue,.

Joint Scheduling and Power Control for Wireless ... - Semantic Scholar
This is further aggravated in ad-hoc networks since all nodes are mobile ..... Go to next slot i = i + 1 .... We compare the structure of the power control problem.

Joint Scheduling and Flow Control for Multi-hop Cognitive Radio ...
Cognitive Radio Network with Spectrum Underlay ... multi-hop CRN overlay with a primary network in [2]. .... network can support in sense that there exists a.

Joint Scheduling and Flow Control for Multi-hop Cognitive Radio ...
Cognitive Radio Network with Spectrum Underlay ... multi-hop CRN overlay with a primary network in [2]. .... network can support in sense that there exists a.

A practical multirobot localization system - STRANDS project
form (offline, online), as well as to translate, print, publish, distribute and sell ... School of Computer Science, University of Lincoln ... user's specific application.

Supervisory Plan.pdf
Page 4 of 8. Supervisory Plan.pdf. Supervisory Plan.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Supervisory Plan.pdf. Page 1 of 8.