1 Dynamic Speed and Sensor Rate Adjustment for Mobile Robotic Systems Ala’ Qadi, Steve Goddard University of Nebraska-Lincoln Computer Science and Engineering.

Slides:



Advertisements
Similar presentations
INTERVAL Next Previous 13/02/ Timed extensions to SDL Analysis requirements –Assumptions on moments and duration Semantics with controllable time.
Advertisements

Simulation of Feedback Scheduling Dan Henriksson, Anton Cervin and Karl-Erik Årzén Department of Automatic Control.
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son Presented by Josh Carl.
Time Demand Analysis.
1 “Scheduling with Dynamic Voltage/Speed Adjustment Using Slack Reclamation In Multi-processor Real-Time Systems” Dakai Zhu, Rami Melhem, and Bruce Childers.
MULTI-ROBOT SYSTEMS Maria Gini (work with Elizabeth Jensen, Julio Godoy, Ernesto Nunes, abd James Parker,) Department of Computer Science and Engineering.
Using Real-time Awareness to Manage Performance of Java Clients on Mobile Robots Andrew McKenzie, Shameka Dawson, Quinton Alexander, and Dr. Monica Anderson.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
From HRT-HOOD to ADA95 Real-Time Systems Lecture 5 Copyright, 2001 © Adam Czajka.
Projects. 1. Path planning – Input: 2D map, initial location, destination Output: waypoints (or false if there is no path). – Input: 2D map, initial location,
Motion planning, control and obstacle avoidance D. Calisi.
Presenter: David Fleeman { D. Juedes, F. Drews, L. Welch and D. Fleeman Center for Intelligent, Distributed & Dependable.
Fail-Safe Mobility Management and Collision Prevention Platform for Cooperative Mobile Robots with Asynchronous Communications Rami Yared School of Information.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
By: Scott Tipton and Nick Halabi Advisor: Dr. Aleksander Malinowski Bradley University December 3, 2010.
SIGMETRICS 2008: Introduction to Control Theory. Abdelzaher, Diao, Hellerstein, Lu, and Zhu. CPU Utilization Control in Distributed Real-Time Systems Chenyang.
Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.
1 of 12 May 3, 2000 Performance Estimation for Embedded Systems with Data and Control Dependencies Paul Pop, Petru Eles, Zebo Peng Department of Computer.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
Integration of Representation Into Goal- Driven Behavior-Based Robots By Dr. Maja J. Mataric` Presented by Andy Klempau.
Autonomous Vehicle Positioning with GPS in Urban Canyon Environments
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
Hybrid Bounding Volumes for Distance Queries Distance Query returns the minimum distance between two geometric models Major application is path planning.
Sonar-Based Real-World Mapping and Navigation by ALBERTO ELFES Presenter Uday Rajanna.
Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen.
MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
Decentralised Coordination of Mobile Sensors School of Electronics and Computer Science University of Southampton Ruben Stranders,
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
A Performance and Schedulability Analysis of an Autonomous Mobile Robot Jiangyang Huang & Shane Farritor Mechanical Engineering University of Nebraska–Lincoln.
Flakey Flakey's BackFlakey's Front. Flakey's Control Architecture The following is cited from the SRI web pages: Overview SRI's mobile robot, Flakey,
Video Mosaics AllisonW. Klein Tyler Grant Adam Finkelstein Michael F. Cohen.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
A Hybrid Method for achieving High Accuracy and Efficiency in Object Tracking using Passive RFID Lei Yang 1, Jiannong Cao 1, Weiping Zhu 1, and Shaojie.
Robot Highway Safety Markers algorithm focuses on the sporadic task model, which puts only a lower bound on the time separation interval between the release.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Deployment Strategy for Mobile Robots with Energy and Timing Constraints Yongguo Mei, Yung-Hsiang Lu, Y. Charlie Hu, and C.S. George Lee School of Electrical.
A Node and Load Allocation Algorithm for Resilient CPSs under Energy-Exhaustion Attack Tam Chantem and Ryan M. Gerdes Electrical and Computer Engineering.
Boundary Assertion in Behavior-Based Robotics Stephen Cohorn - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
1 Deterministic Collision-Free Communication Despite Continuous Motion ALGOSENSORS 2009 Saira Viqar Jennifer L. Welch Parasol Lab, Department of CS&E TEXAS.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
A Multidisciplinary Approach for Using Robotics in Engineering Education Jerry Weinberg Gary Mayer Department of Computer Science Southern Illinois University.
Object-Oriented Design and Implementation of the OE-Scheduler in Real-time Environments Ilhyun Lee Cherry K. Owen Haesun K. Lee The University of Texas.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
1 VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks IEEE Infocom’09, Rio de Janeiro, Brazil Jaehoon Jeong (Paul), Yu Gu, Tian He.
Design of Technical Condition Monitoring System of Vehicle Based on CAN Bus Authors : Ruili Zeng, Yunkui Xiao Department of Automobile Engineering Academy.
Abstract A Structured Approach for Modular Design: A Plug and Play Middleware for Sensory Modules, Actuation Platforms, Task Descriptions and Implementations.
Introduction to Embedded Systems Rabie A. Ramadan 5.
CS 351/ IT 351 Modeling and Simulation Technologies HPC Architectures Dr. Jim Holten.
Multimedia Computing and Networking Jan Reduced Energy Decoding of MPEG Streams Malena Mesarina, HP Labs/UCLA CS Dept Yoshio Turner, HP Labs.
Introduction to Real-Time Systems
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Navigation Strategies for Exploring Indoor Environments Hector H Gonzalez-Banos and Jean-Claude Latombe The International Journal of Robotics Research.
Mok & friends. Resource partition for real- time systems (RTAS 2001)
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Distance (m) Time (s) What is the position of the car at the instant of time t = 2 s? What is the position of the car at the instant of time t = 4 s? Starting.
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Navigation In Dynamic Environment
Graphing Motion Walk Around
Chapter 1-Lesson 1 Position and Motion Vocabulary
Presentation transcript:

1 Dynamic Speed and Sensor Rate Adjustment for Mobile Robotic Systems Ala’ Qadi, Steve Goddard University of Nebraska-Lincoln Computer Science and Engineering Department Jiangyang Huang, Shane Farritor University of Nebraska-Lincoln Mechanical Engineering Department

2 Introduction: Mobile Robotic Systems  As real-time systems, computations must be completed within established response times.  As spatial systems, the computation performed and their timeliness will be dependent on: The location of the platform in its environment. The velocity with which the platform is moving. The existence of objects in the environment.

3 Challenges  Task execution requirements change as the platform moves in the environment.  Platform velocity is dependent on the rate system can collect and process data.  Dynamic changes in the environment (obstacle) might lead to overload conditions.

4 Contributions  An abstract analysis methodology for mobile real-time systems that integrates spatio- temporal properties: processing windows. zone abstractions.  Dynamic adjustment algorithm: maintains a maximum speed less than or equal to the desired speed. maintains schedulabilty by adjusting  processing window.  platform speed.

5 Processing windows  Processing Window: The time interval from the instant the platform starts collecting data to the moment the platform must finish processing the data.  A processing window is the deadline for execution of one or more interdependent tasks.

6 Zones: No Motion 2-Dimensional Zone Example We define a zone as the area for which the platform collects and processes sensor information, creates a map for the area and plans its path through the area.

7 Zones: Mobile System In Motion In motion, safety area included

8 Zones: Definitions  Planning Point F i =(t i F,L i F )  Data Collection Point B i =(t i B,L i B ) Two-Dimensional Zones  L i F =(x i F,y i F, i F )  L i B =(x i B,y i B, i B )  F i =(t i F,x i F,y i F, i F )  B i =(t i B,x i B,y i B, i B )

9 Zones: Zone Processing Windows Maximal ScanningMinimal Scanning

10 Dynamic Processing Windows  Changes in the platform environment.  Increasing the maximum possible platform speed.  Increasing performance for processing window related task.

11 Sensor Impact on Processing Window Length  The zone processing window of the platform is dependent on sensor parameters: number of sensor n. set of delays between sensor readings/invocations . set of sensor range and sensitivity R. set of sensor tasks execution times E. feasibility function g is dependent on the sensors and the associated tasks and parameters. Independent delays, R, Sensor range dependent delays

12 Schedulabilty Impact on Processing Window Length  Any mobile real-time platform will have a set of tasks  is set of tasks associated with the zone processing window w.  is a (possibly empty) set of periodic tasks with higher priority than.  is a (possibly empty) set of periodic tasks with lower priority than.

13 Schedulabilty Impact: Fixed Priority Scheduling

14 Combining the sensor bound with the schedulabilty bound.  If, to find the lower bound on w, Solve  The same procedure can be extended if.

15 Motion Impact on Processing Window Length  The maximum speed at which the platform can travel is related to the rate the environment can be scanned and signals processed.  The speed of the platform for a zone is dependent on The radius of the zone. The zone-processing window. The speed of the platform in the previous zone. The existence of obstacles in the zone.

16 Motion Impact on Processing Window Length First Zone Z 0 Beyond Z 0 Motion Bound

17 Example: 2-dimisional Constant Speed If at any plan point F i we change the zone processing window w i or change the sensor detection range r i.

18 Motion Impact on Processing Window Length: Obstacles Exist  The distance the platform can safely move is not the zone radius.  Move safe distance between the obstacle and the platform, X obs.  If X obs < D i

19 Processing Window Adjustment Algorithm

20 Processing Window Speed/Adjustment Algorithm

21 Case Study1: Robot Navigation Using Sonar Sensors  Companion is a robot with 24 sonar sensors, 15 o apart.

22 Task Processing Graph

23 Motion Bounds  No Obstacles  Obstacles Exist

24 Simulation Without Processing Window/Speed Adjustment With Processing Window/Speed Adjustment

25 Actual Test Without Processing Window/Speed Adjustment With Processing Window/Speed Adjustment

26 Results Summary without Algorithmwith Algorithm t total (s) %96.04% without Algorithmwith Algorithm t total (s) %72.18% 59.97%73.7% Simulation Result Summary Actual Test Summary

27 Conclusion  We presented a method for integrating speed requirements of a mobile robotic platform with real-time fixed priority scheduling.  New abstractions called zones and processing windows were created.  An algorithm for the adjusting zone processing window was developed.  Improved system performance (Speed).

28 Processing Window Adjustment Algorithm

29 Motivation  Unlike traditional real-time applications, the platform requires support for: interdependent tasks with inter-delays. relating the deadline of a task to a spatial concept. dynamically changing execution requirements due to the environment.