Automatic geospatial web service composition for developing a routing system

Routing or path finding is one of the most popular services, which is widely used by citizens and tourists, around the world. These systems, which are generally developed based on [i]WebGIS[/i] provide users with the capability of introducing a start and an end point and then to observe the optimum (e.g. shortest) path between these two points. However these systems can only perform analysis for specific areas for which the data is available in the [i]WebGIS[/i] and also can only work based on the specific routing algorithm(s), by which the system is designed. To increase the flexibility of the system, an alternative solution could be the availability of a Web-based routing system that works based on [i]Distributed Geospatial Information System (DGIS)[/i] and [i]Automatic Service Composition techniques[/i]. An aim of this research is to design and develop a system for routing based on automatic service composition. Although, many efforts have been done to develop path finding algorithms for vehicle navigation, less attention has been paid on developing flexible path finding algorithms for pedestrians. So another aim of this research is to develop such an algorithm. In this research, a routing algorithm for pedestrians was developed, implemented and tested based on [i]OGC’s WPS[/i] standard. This was conducted, as part of the European Union funded [i]HaptiMap[/i] project. Also, general architecture of a routing system that works based on automatic Web service composition was designed and implemented. The results of the test and the evaluation of the system shows: -The applicability and the flexibility of the proposed routing algorithm for pedestrians. -The flexibility and the efficiency of routing based on automatic service composition.Popular science Routing or path finding is one of the most popular internet-based systems, which is widely used by citizens and tourists, around the world. These systems provide users with the capability of introducing a start and an end point and then to observe the optimum (e.g. shortest) path between these two points. However, these systems are generally based on internet GIS and can only perform analysis for specific areas for which the data is available in the system. This means that if the user requests a path for which the system has no available data or routing functionality, it is not responsive. Although the data or functionality needed for routing for a specific area may not be gathered within one service on internet, but still could exist as scattered components in different locations. In this case the availability of a service which is more flexible and can do routing on any given geographical boundary is desired. This thesis presents a system based on [i]Automatic Web Service Composition[/i] that is capable of searching on the Internet to find available data and mechanisms needed for finding path requested by user. The system orchestrates the Web services in proper order automatically, and at last shows the path found on a map to the user. Algorithms of path finding are each designed for a specific purpose. In general they can be categorized into algorithms designed for vehicles and algorithms designed for pedestrians. The rapid popularity of navigation systems in cars has caused the algorithms of second kind to be neglected. In most applications the path which is offered by the system is more proper for vehicles and special limitations, preferences and capabilities of pedestrians are not considered. The simplest example could be possibility of making shortcuts when walking in a city. Pedestrians are not restricted to streets and can make shortcuts through parks, yards, pathways and open spaces while traveling. As a second aim, this research presents a shortest path algorithm with a special emphasis on open spaces in cities for pedestrians. The algorithm is tested and results show the applicability and the flexibility of it for pedestrians.Routing or path finding is one of the most popular internet-based systems, which is widely used by citizens and tourists, around the world. These systems provide users with the capability of introducing a start and an end point and then to observe the optimum (e.g. shortest) path between these two points. However, these systems are generally based on internet GIS and can only perform analysis for specific areas for which the data is available in the system. This means that if the user requests a path for which the system has no available data or routing functionality, it is not responsive. Although the data or functionality needed for routing for a specific area may not be gathered within one service on internet, but still could exist as scattered components in different locations. In this case the availability of a service which is more flexible and can do routing on any given geographical boundary is desired. This thesis presents a system based on [i]Automatic Web Service Composition[/i] that is capable of searching on the Internet to find available data and mechanisms needed for finding path requested by user. The system orchestrates the Web services in proper order automatically, and at last shows the path found on a map to the user. Algorithms of path finding are each designed for a specific purpose. In general they can be categorized into algorithms designed for vehicles and algorithms designed for pedestrians. The rapid popularity of navigation systems in cars has caused the algorithms of second kind to be neglected. In most applications the path which is offered by the system is more proper for vehicles and special limitations, preferences and capabilities of pedestrians are not considered. The simplest example could be possibility of making shortcuts when walking in a city. Pedestrians are not restricted to streets and can make shortcuts through parks, yards, pathways and open spaces while traveling. As a second aim, this research presents a shortest path algorithm with a special emphasis on open spaces in cities for pedestrians. The algorithm is tested and results show the applicability and the flexibility of it for pedestrians