2-D ESPO Algorithm for pedestrian navigation A 2-D Euclidean shortest path with obstacles (ESPO) algorithm for pedestrian navigation was developed. This.

Slides:



Advertisements
Similar presentations
TU e technische universiteit eindhoven / department of mathematics and computer science Modeling User Input and Hypermedia Dynamics in Hera Databases and.
Advertisements

Modeling Maze Navigation Consider the case of a stationary robot and a mobile robot moving towards a goal in a maze. We can model the utility of sharing.
Real-time, low-resource corridor reconstruction using a single consumer grade RGB camera is a powerful tool for allowing a fast, inexpensive solution to.
The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha CS 383.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
ISBN Chapter 3 Describing Syntax and Semantics.
James Martin CpE 691, Spring 2010 February 11, 2010.
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Technical Advisor : Mr. Roni Stern Academic Advisor : Dr. Meir Kalech Team members :  Amit Ofer  Liron Katav Project Homepage :
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
ADVISE: Advanced Digital Video Information Segmentation Engine
Supervised by Prof. LYU, Rung Tsong Michael Department of Computer Science & Engineering The Chinese University of Hong Kong Prepared by: Chan Pik Wah,
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
Chapter 5. Database Aspects of Location-Based Services Lee Myong Soo Mobile Data Engineering Lab. Dept. of.
Introduction to the Internet How did the Internet start? Why was the Internet developed? How does Internet handle the traffic? Why WWW changed the Internet.
August 7, 2003 Virtual City : A Heterogeneous System Model of an Intelligent Road Navigation System Incorporating Data Mining Concepts Mike Kofi Okyere.
Geographic Information Systems
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
Describing Syntax and Semantics
Haptic: Image: Audio: Text: Landmark: YesNo YesNo YesNo YesNo YesNo Haptic technology, or haptics, is a tactile feedback technology that takes advantage.
A Tool for Describing and Evaluating Hierarchical Real-Time Bus Scheduling Policies Author: Trevor Meyerowitz, Claudio Pinello, Alberto DAC2003, June 24,2003.
GIS Analysis. Questions to answer Position – what is here? Condition – where are …? Trends – what has changed? Pattern – what spatial patterns exist?
CEM 514 Modeling of Construction Operations The LP/IP hybrid method for construction time-cost trade-off analysis By Samir Abdallah Sulaiman.
1 Prototype Hierarchy Based Clustering for the Categorization and Navigation of Web Collections Zhao-Yan Ming, Kai Wang and Tat-Seng Chua School of Computing,
Spatial data Visualization spatial data Ruslan Bobov
Smart Learning Services Based on Smart Cloud Computing
Introduction Using time property and location property from lost items’ pictures, we construct the Lost and Found System which combined with image search.
Chapter 10 Architectural Design
DEXA 2005 Quality-Aware Replication of Multimedia Data Yicheng Tu, Jingfeng Yan and Sunil Prabhakar Department of Computer Sciences, Purdue University.
Sensor Network Navigation without Locations Mo Li, Yunhao Liu, Jiliang Wang, and Zheng Yang Department of Computer Science and Engineering Hong Kong University.
A Java-based tool for determining if spatial objects (polygons) require simplification before delivery to a mobile device using a Location-based Service.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
1. Wheeler, R.E. Notes on View Camera Geometry. 2003, Wolf, P.R. and DeWitt, B.A. Elements of Photogrammetry(with.
Geographic Information System GIS This project is implemented through the CENTRAL EUROPE Programme co-financed by the ERDF GIS Geographic Inf o rmation.
Sharad Oberoi and Susan Finger Carnegie Mellon University DesignWebs: Towards the Creation of an Interactive Navigational Tool to assist and support Engineering.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
The OpenStreetMap project The OpenStreetMap Project is one of the best known examples of Volunteered Geographic Information on the Internet today. The.
Vvisual comparision of data Measuring the quality of Volunteered Geographic Information (VGI) datasets such as OpenStreetMap is often attempted without.
Combined Central and Subspace Clustering for Computer Vision Applications Le Lu 1 René Vidal 2 1 Computer Science Department, Johns Hopkins University,
Shortest Path Navigation Application on GIS Supervisor: Dr. Damitha Karunaratne Thilani Imalka 2007/MCS/023.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Efficient Route Computation on Road Networks Based on Hierarchical Communities Qing Song, Xiaofan Wang Department of Automation, Shanghai Jiao Tong University,
Graphical Toolbox For Enhancements in Operations Research Education Author: Ramzi Kesrouany Research Advisor: Dr. Nan Kong Department of Industrial & Management.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Architecture of Decision Support System
Easiest-to-Reach Neighbor Search Fatimah Aldubaisi.
Everyday Mapping of Traffic Conditions - An Urban Planning Tool Laboratory of Geodesy Aristotle University of Thessaloniki, Department of Civil Engineering.
Christoph F. Eick Questions and Topics Review November 11, Discussion of Midterm Exam 2.Assume an association rule if smoke then cancer has a confidence.
XML stands for Extensible Mark-up Language XML is a mark-up language much like HTML XML was designed to carry data, not to display data XML tags are not.
A Software Framework for Distributed Services Michael M. McKerns and Michael A.G. Aivazis California Institute of Technology, Pasadena, CA Introduction.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
INTRODUCTION TO GIS  Used to describe computer facilities which are used to handle data referenced to the spatial domain.  Has the ability to inter-
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
Roland Geraerts and Erik Schager CASA 2010 Stealth-Based Path Planning using Corridor Maps.
WFM 6202: Remote Sensing and GIS in Water Management © Dr. Akm Saiful IslamDr. Akm Saiful Islam WFM 6202: Remote Sensing and GIS in Water Management Dr.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
C ROWD P LANNER : A C ROWD -B ASED R OUTE R ECOMMENDATION S YSTEM Han Su, Kai Zheng, Jiamin Huang, Hoyoung Jeung, Lei Chen, Xiaofang Zhou.
® Sponsored by Navigation in Urban Areas 98th OGC Technical Committee Washington, DC USA John R. Herring 8 March 2016 Copyright © 2016 Open Geospatial.
INTRODUCTION TO GEOGRAPHICAL INFORMATION SYSTEM
The Improvement of PaaS Platform ZENG Shu-Qing, Xu Jie-Bin 2010 First International Conference on Networking and Distributed Computing SQUARE.
Working with your archive organization Broadening your user community
Geographic Information Systems
DrillSim July 2005.
Parking Tour Generator September 2018
Data and Computer Communications
Mashup Service Recommendation based on User Interest and Service Network Buqing Cao ICWS2013, IJWSR.
Efficient Task Allocation for Mobile Crowdsensing
Geographic Information Systems
Presentation transcript:

2-D ESPO Algorithm for pedestrian navigation A 2-D Euclidean shortest path with obstacles (ESPO) algorithm for pedestrian navigation was developed. This algorithm can be applied to pedestrian navigation inside open spaces, such as squares, grasslands and big halls. Path generation is based on the Dijkstra algorithm, which is extended to solve the path planning problem not only for path and road networks but also for open spaces, even with obstacles inside. Towards Multi-mode Pedestrian Navigation Using OpenStreetMap Data Jianghua Zheng, Adam Winstanley, Zhangang Zhang, Błażej Ciepłuch, Zheng Pan, Peter Moony, Ricky Jacob, Xiaoyu Chen, Sean Smith and Hao Liu It builds a link-node network, including topological information of open- boundary areas, by representing each open-boundary area as a single point within or on its boundary. A single point is also used to represent adjacent multiple open-boundary areas (named extended open polygons) in the newly-built network. Traditional optimal path planning algorithm, e.g. Dijkstra algorithm, is used at the first level based on the newly-built link-node network. The second level combines this with the optimal path determination through or inside open-boundary areas. The algorithm better solves the cases that the path passing through adjacent open boundary areas and it improves the computing efficiency. Path planning with open boundary areas OpenStreetMap: Good data source for pedestrian navigation, especially for small towns and resorts. Reasons: 1) Totally free. All data are generated by the public with little usage restrictions and no cost. The OSM tools and APIs are powerful but are also free. 2) More vivid map data with various attributes. OSM provide the public a set of powerful tools to render your own style OSM data for your personal map based applications. 3) More fresh data. OSM data is being updated constantly. For example, the OSM data of Ireland is updated weekly. 4) Multiple outputs. It is possible to render various popular formats of data of the same area from the OSM dataset giving flexibility of use. CloudMade and PgRouting: We use third party modules to carry out path planning for pedestrians to understand their advantages and disadvantages. This is helpful to develop our own modules. Own PostGIS-Based pedestrian wayfinding module: We develop a restricted area path planning algorithm as a open source module using java. This module can improve computing efficiency. However, the result might not be the shortest one. Routing in bad weather: People would like to seek a path most possibly inside buildings to avoid rain and wind in most cases. We use dynamic locale weather information from Yahoo weather in the path planning computing. If there are strong wind, people would like to seek path which most possibly has shelter against the wind. We are not working on analysis the result differences on the topic. 1) Multi-lingual route description Besides a route on map displaying before users, it is helpful to describe the route in text. We extended the English route description engine to Chinese service combined and Irish language service is under construction. Research presented in this poster was funded by a Strategic Research Cluster Grant (07/SRC/I1168) by Science Foundation Ireland under the National Development Plan. The authors gratefully acknowledge this support. Multimedia aided pedestrian navigation Human behavior-based smart routing OSM-based routing modules for various terminals Fig.1 Shortest path computed in a walking area Two-Level Path Planning Algorithm A two-level path planning algorithm for 2-D pedestrian navigation with open- boundary areas was proposed as an improved version/extension of the ESPO algorithm. Fig.2 Abstraction of relationships between open polygons 2) Geotagged photography aided navigation When a user is walking around a decision point while he is following an optimal path, it will trigger to show a possible image facing to the user. The photograph IDs are give by nodes IDs from which we can also extract the direction relationship. After it obtains an optimal path, it will retrieve images according to nodes sequence of the path. 3) Haptics aided navigation Pedestrians are easy to lost theirs way while following an optimal path, especially in some places without enough landmarks. Haptics is useful to notify users that they have deviated their way and it’s time to look at the map or possible geotagged photography or other available multimedia help to follow their optimal paths. Fig.3 Multimedia aided pedestrian navigation Fig.4 results of general path planning and smarter routing Pedestrian navigation in an emergency It takes users’ behavior into account and generates life saving optimal paths for users. Fig.5 simulation and guidance under fire inside building using CA module