159.741 Intelligent Robotics Paper Coordinator: Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm. 2.56.

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

Application a hybrid controller to a mobile robot J.-S Chiou, K. -Y. Wang,Simulation Modelling Pratice and Theory Vol. 16 pp (2008) Professor:
INF1090 Special Project Photography.
1 CS101 Introduction to Computing Lecture 17 Algorithms II.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
What is vision Aristotle - vision is knowing what is where by looking.
Robot Motion Planning: Approaches and Research Issues
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
Automatic measurement of pores and porosity in pork ham and their correlations with processing time, water content and texture JAVIER MERÁS FERNÁNDEZ MSc.
Virtual Dart: An Augmented Reality Game on Mobile Device Supervisor: Professor Michael R. Lyu Prepared by: Lai Chung Sum Siu Ho Tung.
John S Gero Agents – Agent Simulations AGENT-BASED SIMULATIONS.
Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.
Objective of Computer Vision
Objective of Computer Vision
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
On Error Preserving Encryption Algorithms for Wireless Video Transmission Ali Saman Tosun and Wu-Chi Feng The Ohio State University Department of Computer.
lecture 2, linear imaging systems Linear Imaging Systems Example: The Pinhole camera Outline  General goals, definitions  Linear Imaging Systems.
OPTICAL FLOW The optical flow is a measure of the change in an image from one frame to the next. It is displayed using a vector field where each vector.
Genetic Programming.
Object-Oriented Programming Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm QA, IIMS, Albany.
Basic Mathematics Rende Steerenberg BE/OP CERN Accelerator School Basic Accelerator Science & Technology at CERN 3 – 7 February 2014 – Chavannes de Bogis.
1. Optimization and its necessity. Classes of optimizations problems. Evolutionary optimization. –Historical overview. –How it works?! Several Applications.
Technology and digital images. Objectives Describe how the characteristics and behaviors of white light allow us to see colored objects. Describe the.
Computer Networks Paper Coordinator: Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm
Associative Pattern Memory (APM) Larry Werth July 14, 2007
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
Artificial Intelligence
3D SLAM for Omni-directional Camera
Spacetime Constraints Revisited Joe Marks J. Thomas Ngo Using genetic algorithms to find solutions to spacetime constraint problems in 2D.
CSCE 5013 Computer Vision Fall 2011 Prof. John Gauch
© 2008 Chen Hao, Beijing Institute of Technology 1 Intelligent Parking System: Parking Guide Application in Beijing and Method for License Plate Localization.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Sensing for Robotics & Control – Remote Sensors R. R. Lindeke, Ph.D.
High-Resolution Interactive Panoramas with MPEG-4 발표자 : 김영백 임베디드시스템연구실.
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
Module 2 : Linearity AGENDA TVI Vision, Kari Siren Linearity in general Theory, what does non-linearity mean when measuring “true” colour How to measure,
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
CGMB214: Introduction to Computer Graphics
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
IntroductionColour SpaceClassificationFuzzy Contrast FusionRule ExtractionConclusionsLearningLearning D.Playne, V.Mehta, N.Reyes, A.Barczak Computer Science,
A note on oral presentations These are the progress report presentations. Please note that the individual presentations should be ~8 min long. Since the.
How to startpage 1. How to start How to specify the task How to get a good image.
1 Structure of Aalborg University Welcome to Aalborg University.
Title Slide Progress Report Name. Goal Goal Statement – ex. design/create/fabricate … - should be clear and short Needs/Problems – clear and short Space.
Active Vision Sensor Planning of CardEye Platform Sherif Rashad, Emir Dizdarevic, Ahmed Eid, Chuck Sites and Aly Farag ResearchersSponsor.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Digital Camera TAVITA SU’A. Overview ◦Digital Camera ◦Image Sensor ◦CMOS ◦CCD ◦Color ◦Aperture ◦Shutter Speed ◦ISO.
Higher Vision, language and movement. Strong AI Is the belief that AI will eventually lead to the development of an autonomous intelligent machine. Some.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
研 究 生:周暘庭 Q36994477 電腦與通信工程研究所 通訊與網路組 指導教授 :楊家輝 Mean-Shift-Based Color Tracking in Illuminance Change.
Intelligent Vision Systems Image Geometry and Acquisition ENT 496 Ms. HEMA C.R. Lecture 2.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
An Introduction to Digital Image Processing Dr.Amnach Khawne Department of Computer Engineering, KMITL.
Department of Electrical Engineering, Southern Taiwan University 1 Robotic Interaction Learning Lab The ant colony algorithm In short, domain is defined.
Camera Settings What Do They Do?. Opening in the camera that controls the amount of light that reaches the image sensor Aperture.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
A Presentation on Adaptive Neuro-Fuzzy Inference System using Particle Swarm Optimization and it’s Application By Sumanta Kundu (En.R.No.
Unit 5: Developing the Training Program 1 © SHRM 2009.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
4/22/20031/28. 4/22/20031/28 Presentation Outline  Multiple Agents – An Introduction  How to build an ant robot  Self-Organization of Multiple Agents.
UFOAnalyzerV2 (UA2) the key of accuracy
Common Classification Tasks
CIS 488/588 Bruce R. Maxim UM-Dearborn
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

Intelligent Robotics Paper Coordinator: Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm QA, or IIMS Lab 7, Albany Campus Tel. No.: x 9512 or Fax No.:

Topics for Discussion Pre-requisites Course Overview Learning Outcomes Texts and Course Material Assessment Course Schedule

Design and implement algorithms for control, classification and optimization systems. Learning Outcomes Describe the main algorithms used in building intelligent systems.. Identify the advantages and disadvantages of applying various AI techniques in solving real world problems. On successful completion of the course, the students should be able to:

Assessment 2 assignments: 40% Seminar + written report + program: 30% The course will be assessed by a combination of practical and theoretical works. CLOSED BOOKThere will be practical works, one seminar and one three hour exam. The exam will be a CLOSED BOOK exam. All assignments will be submitted in class/electronically. Final Exam (3 hours): 30%

Seminar + report + code A research topic will have to be proposed. Upon my approval, you can use it for your seminar. The seminar is to be presented in class (20-25 minutes) RESEARCH ASSIGNMENT The report should discuss the theory and algorithms well. All formulas should be explained, and there should be an accompanying sample computation for each. A sample code simulating the algorithm must be submitted. Instructions on how to use the code must be included in the documentation.

Candidate Research Topics Potential field approach to robot navigation Neuro-Fuzzy approach to robot navigation RESEARCH ASSIGNMENT Complex, specialised robot behaviours Incremental Learning Any hybrid algorithm Any intelligent colour object recognition

Input: x, v, theta, angular velocity Control System: Inverted Pendulum Problem Output: Force, direction Otherwise known as Broom-Balancing Problem The mathematical solution uses a second- order differential equation that describes cart motion as a function of pole position and velocity:

Fuzzy Rules Fuzzy rule base and the corresponding FAMM for the velocity and position vectors of the inverted pendulum-balancing problem 1.IF cart is on the left AND cart is going left THEN largely push cart to the right 2.IF cart is on the left AND cart is not moving THEN slightly push cart to the right 3.IF cart is on the left AND cart is going right THEN don’t push cart 4.IF cart is centered AND cart is going left THEN slightly push cart to the right 5.IF cart is centered AND cart is not moving THEN don’t push cart 6.IF cart is centered AND cart is going right THEN slightly push cart to the left 7.IF cart is on the right AND cart is going left THEN don’t push cart 8.IF cart is on the right AND cart is not moving THEN push cart to the left 9.IF cart is on the right AND cart is going right THEN largely push cart to the left

Input: x, v, theta, angular velocity Fuzzy Control System Output: Force, direction Inverted Pendulum Problem If the cart is too near the end of the path, then regardless of the state of the broom angle push the cart towards the other end. X NZEP NPLZE X’ZE P NL If the broom angle is too big or changing too quickly, then regardless of the location of the cart on the cart path, push the cart towards the direction it is leaning to.  NZEP NNLNMZE ’’ NMZEPM PZEPMPL

Input: MultipleObstacles: x, y, angle Target’s x, y, angle Robot Navigation Output: Robot angle, speed Obstacle Avoidance, Target Pursuit, Opponent Evasion

Cascade of Fuzzy Systems Adjusted Speed Adjusted Angle Next Waypoint N Y Adjusted Speed Adjusted Angle Fuzzy System 1: Target Pursuit Fuzzy System 2: Speed Control for Target Pursuit Fuzzy System 3: Obstacle Avoidance Fuzzy System 4: Speed Control for Obstacle Avoidance ObstacleDistance < MaxDistanceTolerance and closer than Target Actuators Path planning Layer: The A* Algorithm Multiple Fuzzy Systems employ the various robot behaviours Multiple Fuzzy Systems employ the various robot behaviours Fuzzy System 1 Fuzzy System 2 Fuzzy System 3 Fuzzy System 4 Path Planning Layer Central Control Target Pursuit Obstacle Avoidance

Input: Obstacles’ x, y, angle Target’s x, y, angle Hybrid Fuzzy A* Output: Robot angle, speed C:\Core\Massey Papers\159302\Assignments 2008\Assign # \Robot Navigation - v FL-AStar

Simulations 3-D Hybrid Fuzzy A* Navigation System Cascade of Fuzzy Systems

Nature as Problem Solver Beauty-of-nature argument How Life Learned to Live (Tributsch, 1982, MIT Press) Example: Nature as structural engineer

15 Genetic Algorithm Let’s see the demonstration for a GA that maximizes the function n =10 c c = = 1,073,741,823

16 Simple GA Example Function to evaluate: coeff – chosen to normalize the x parameter when a bit string of length lchrom =30 is chosen. Since the x value has been normalized, the max. value of the function will be: when for the case when lchrom=30 Fitness Function or Objective Function

17 Test Problem Characteristics 30 With a string length=30, the search space is much larger, and random walk or enumeration should not be so profitable =1.07(10 10 ) points There are 2 30 =1.07(10 10 ) points. With over 1.07 billion points in the space, one- at-a-time methods are unlikely to do very much very quickly Also, only 1.05 percent of the points have a value greater than 0.9.

Page Actual Plot Also, only 1.05 percent of the points have a value greater than 0.9.

19 Simple GA Implementation Initial population of chromosomes Calculate fitness value PopulationOffspring Stop Solution Found? Evolutionary operations Yes No

Identifying Colour Objects with

Robot Soccer Set-up Colour objects Fluorescent lamps Overhead Camera Exploratory environment is indoor – room totally obstructed from sunlight Multiple monochromatic light sources – fluorescent / fluoride lamps Colour Object Recognition (Recognition speed: < 33ms) IIMS Lab 7 *

Machine Vision System 3D Scene Optics (Lens) Image Sensors CameraFrame Grabber 2D Digital Image CCD (Charge Coupled Device) CID (Charge Injection Device) PDA (Photo Diode Array) Firewire camera Emmitted light 2-D Intensity Image Continuous charge signal HARDWARE OUTLINE *

Colour as the machine sees it Colour constancy is inherent in us humans, but not in cameras. Colour constancy is inherent in us humans, but not in cameras. Color is not captured by the camera as we humans see it. Yellow object turns pale under strong white illumination A Green object tends to appear more as a whitish yellow object under bright white illumination.

Illumination Conditions Colour objects traversing the field under spatially varying illumination intensities We need to automatically compensate for the effects of varying illumination intensities in the scene of traversal * Dark Bright Dim Lens focus Object rotation Quantum electrical effects Shadows Presence of similar colours Other Factors:

Recent Developments To some extent, the algorithm can see in the dark Applying the colour contrast operations to compensate for the effects of glare, hue and saturation drifting also allows for colour correction Experiments performed at IIMS Lab 7

Recent Developments Experiments performed at IIMS Lab 7 PINK colour patches can be amplified to revert back close to its original colour *

Robots in action The Fuzzy Vision algorithm employed in the game… Old system Robots at Massey C:\Core\Research\Conferences\ICONIP08