scholarly journals Spatial Analysis on Networks: Towards identifying similarity of routes

2021 ◽  
Vol 12 (4) ◽  
pp. 45-57
Author(s):  
Panagiotis Agourogiannis ◽  
◽  
Dimitris Kavroudakis1 ◽  
Marios Batsaris ◽  
◽  
...  
Keyword(s):  
Road Network ◽  
Spatial Information ◽  
Search Algorithm ◽  
Local Development ◽  
Optimal Path ◽  
Spatial Queries ◽  
Cultural Elements ◽  
Network Nodes ◽  
Points Of Interest ◽  
Open Source Gis

Finding an optimal path in a road network is a method of planning and decision-making that is mainly related to transportations and emergency response. The paper presents an algorithm for finding optimal paths in spatial networks, through the utilization of open source GIS and mathematical analysis of Networks using Graph Theory as well as using geographical proximity attributes of network nodes. The geometric and spatial information of the network as well as its relations with points of interest (POI) of the study areas located at the nodes and edges of the network, are transformed into spatial information, which by applying spatial queries in a geographical database (Postgis/Pgrouting) give query-enabled paths. The case study for the application of the algorithm and finding a route based on spatial queries is the island of Lesvos. This island combines intense topography and a complex road network with multiple geometric relationships. The area also has points of interest such as cultural, tourist and social. The final route will be a synthesis of morphological, tourist and cultural elements similar to the spatial search queries. Finally, the methodology as well as the search algorithm can be applied to any Spatial Network (transportations, environment, energy) described by its geographical features, considering all kinds of geographical issues, thus solving spatial problems and contributing to local development.

scholarly journals Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
De-Xin Yu ◽  
Zhao-Sheng Yang ◽  
Yao Yu ◽  
Xiu-Rong Jiang
Keyword(s):  
Data Storage ◽  
Road Network ◽  
Large Scale ◽  
Search Algorithm ◽  
Optimal Path ◽  
Search Method ◽  
Urban Road Network ◽  
Urban Road ◽  
Path Search ◽  
Route Search

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

scholarly journals Impacts of Built Environment on Urban Vitality: Regression Analyses of Beijing and Chengdu, China

2019 ◽  
Vol 16 (23) ◽  
pp. 4592 ◽  
Author(s):  
Shiwei Lu ◽  
Chaoyang Shi ◽  
Xiping Yang
Keyword(s):  
Built Environment ◽  
Road Network ◽  
Spatial Information ◽  
Compact City ◽  
Environment Factors ◽  
Planning And Design ◽  
Points Of Interest ◽  
Two Cities ◽  
Urban Planning And Design ◽  
Four Levels

The loss of urban vitality is an important problem in the development of urban central areas. Analyzing the correlation between urban built environment and urban vitality supports urban planning and design. However, current research excludes the study of how consistent built environment factors affect urban vitality of cities with different development situations. Therefore, using social media check-in data, this paper measures neighborhood vibrancy in urban central areas in Beijing and Chengdu, China. Four levels of spatial information were used to measure the built environment: regulatory planning management unit (RPMU), land use, road network, and building. Regression model is used to quantify the correlation between urban vitality and the built environment of these two cities. The study found a strong correlation between built environment factors and urban vitality. Among the built environment factors, points of interest (POI) diversity and public transport accessibility indicators were strongly positively correlated with neighborhood vibrancy. However, the density indicators had totally different effects on urban vitality of cities with different development situations, which is excluded in existing studies. This research strengthens the practical understanding of the compact city concept, and can support the design and planning of urban built environment.

scholarly journals DETERMINATION OF TRANSPORT ACCESSIBILITY IN THE FORMATION OF TOURIST ROUTES USING QGIS AND GRASS GIS

2021 ◽  
pp. 297-307
Author(s):  
Vladyslav Tretiak ◽  
Viktoriia Lepetiuk
Keyword(s):  
Spatial Analysis ◽  
Data Processing ◽  
Road Network ◽  
Information Technologies ◽  
Spatial Information ◽  
Grass Gis ◽  
Transport Accessibility ◽  
The Road ◽  
Points Of Interest ◽  
Mode Of Transport

The creation of modern tourist products contributes to the attractiveness of our country in the market of tourist services. Transport accessibility is an important aspect for creating tourism products. This study considers the algorithm for determining transport accessibility for the projection of tourist travel routes, based on the use of geographic information technologies. Transport accessibility is determined by collecting and filtering data and subsequent creation of isochron maps, which show the time distance when moving a particular mode of transport along the lines of the road network from points of interest. Attractions of Ternopil region were chosen as such points of interest for tourists. The paper uses open OSM data on tourist facilities and the road network. Data preparation was performed using PostgreSQL software. When performing the study, the QGIS program was used, in which data processing was performed. Spatial analysis is performed in the spatial information processing environment GRASS GIS; data processing modules or GRASS GIS plug-ins are used. The proposed algorithm allows forming a database of tourist facilities, transport routes, to define more accurately existing tourist routes, to create new ones. As a test in the course of the study, the route of the tour of Ternopil was designed, in the construction of which an isochron map was used. Spatial analysis helps to better determine the path of the tourist tour and its duration. 

scholarly journals An Innovative Tour Recommendation System using Graph Algorithms

2019 ◽  
Vol 5 (1) ◽  
pp. 32 ◽  
Author(s):  
Md. Sabir Hossain ◽  
Ahsan Sadee Tanim ◽  
Nabila Nawal ◽  
Sharmin Akter
Keyword(s):  
Recommendation System ◽  
Search Algorithm ◽  
Limited Time ◽  
Dijkstra Algorithm ◽  
Breadth First Search ◽  
User Interest ◽  
Trip Planning ◽  
Physical Effort ◽  
Points Of Interest ◽  
Point Of Departure

Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI).Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of this paper. Most of the time people had to find the places he wants to visit in a difficult way. It kills a lot of time.Methods: To cope with this situation we have used different methodology. First, a greedy algorithm is used for filtering the POIs and BFS (Breadth First Search) algorithm will find POI in terms of user interest. The maximum number of visited POI within a limited time will be considered. Then, the Dijkstra algorithm finds the shortest path from the point of departure to the end of tours.Results:  This work shows its users list of places according to the user's interest in a particular city. It also suggests them places to visit in a range from the location of the user where a user can dynamically change this range and it also suggests nearby places they may want to visit.Conclusion: This tour recommendation system provides its users with a better trip planning and thus makes their holidays enjoyable.

scholarly journals AUTOMATIC ROAD SIGN INVENTORY USING MOBILE MAPPING SYSTEMS

2016 ◽  
Vol XLI-B3 ◽  
pp. 717-723 ◽  
Author(s):  
M. Soilán ◽  
B. Riveiro ◽  
J. Martínez-Sánchez ◽  
P. Arias
Keyword(s):  
Point Cloud ◽  
Road Network ◽  
Spatial Information ◽  
Maintenance Planning ◽  
Mobile Mapping ◽  
The Road ◽  
Road Signs ◽  
Road Sign ◽  
Mobile Mapping Systems ◽  
Mapping Systems

The periodic inspection of certain infrastructure features plays a key role for road network safety and preservation, and for developing optimal maintenance planning that minimize the life-cycle cost of the inspected features. Mobile Mapping Systems (MMS) use laser scanner technology in order to collect dense and precise three-dimensional point clouds that gather both geometric and radiometric information of the road network. Furthermore, time-stamped RGB imagery that is synchronized with the MMS trajectory is also available. In this paper a methodology for the automatic detection and classification of road signs from point cloud and imagery data provided by a LYNX Mobile Mapper System is presented. First, road signs are detected in the point cloud. Subsequently, the inventory is enriched with geometrical and contextual data such as orientation or distance to the trajectory. Finally, semantic content is given to the detected road signs. As point cloud resolution is insufficient, RGB imagery is used projecting the 3D points in the corresponding images and analysing the RGB data within the bounding box defined by the projected points. The methodology was tested in urban and road environments in Spain, obtaining global recall results greater than 95%, and F-score greater than 90%. In this way, inventory data is obtained in a fast, reliable manner, and it can be applied to improve the maintenance planning of the road network, or to feed a Spatial Information System (SIS), thus, road sign information can be available to be used in a Smart City context.

Obstacle avoidance and path planning of humanoid robot using fuzzy logic controller aided owl search algorithm in complicated workspaces

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Abhishek Kumar Kashyap ◽  
Dayal R. Parhi
Keyword(s):  
Fuzzy Logic ◽  
Fuzzy Logic Controller ◽  
Fuzzy Controller ◽  
Search Algorithm ◽  
Optimal Path ◽  
Humanoid Robots ◽  
Steering Angle ◽  
Content Type ◽  
Hybrid Controller ◽  
Humanoid Nao

Purpose This paper aims to outline and implement a novel hybrid controller in humanoid robots to map an optimal path. The hybrid controller is designed using the Owl search algorithm (OSA) and Fuzzy logic. Design/methodology/approach The optimum steering angle (OS) is used to deal with the obstacle located in the workspace, which is the output of the hybrid OSA Fuzzy controller. It is obtained by feeding OSA's output, i.e. intermediate steering angle (IS), in fuzzy logic. It is obtained by supplying the distance of obstacles from all directions and target distance from the robot's present location. Findings The present research is based on the navigation of humanoid NAO in complicated workspaces. Therefore, various simulations are performed in a 3D simulator in different complicated workspaces. The validation of their outcomes is done using the various experiments in similar workspaces using the proposed controller. The comparison between their outcomes demonstrates an acceptable correlation. Ultimately, evaluating the proposed controller with another existing navigation approach indicates a significant improvement in performance. Originality/value A new framework is developed to guide humanoid NAO in complicated workspaces, which is hardly seen in the available literature. Inspection in simulation and experimental workspaces verifies the robustness of the designed navigational controller. Considering minimum error ranges and near collaboration, the findings from both frameworks are evaluated against each other in respect of specified navigational variables. Finally, concerning other present approaches, the designed controller is also examined, and major modifications in efficiency have been reported.

A Novel Routing Network Algorithm Via Neutrosphic Fuzzy Set Approach

2021 ◽  
pp. 9-22
Author(s):  
S.Krishna Prabha ◽  
◽  
Broumi said ◽  
Selçuk Topal ◽  
◽  
...  
Keyword(s):  
Public Transportation ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Routing Algorithms ◽  
Network Data ◽  
Main Function ◽  
Network Nodes ◽  
Web Interfaces ◽  
Telephone Networks ◽  
Set Up

Routers steer and bid network data, through packets that hold a variety of categories of data such as records, messages, and effortless broadcasts like web interfaces. The procedure of choosing a passageway for traffic in a network or between several networks is called routing. Starting from telephone networks to public transportation the principles of routing are applied. Routing is the higher-level decision-making that directs network packets from their source en route for their destination through intermediate network nodes by specific packet forwarding mechanisms. The main function of the router is to set up optimized paths among the different nodes in the network. An efficient novel routing algorithm is proposed with the utilization of neutrosophic fuzzy logic in this work addition to many routing algorithms for finding the optimal path in the literature. In this approach, each router makes its own routing decision in the halting time. Various concepts like routing procedures, most expected vector, most expected object, and list of estimated delays are explained.

Priority-based speed control strategy for automated guided vehicle path planning in automated container terminals

2020 ◽  
Vol 42 (16) ◽  
pp. 3079-3090 ◽  
Author(s):  
Meisu Zhong ◽  
Yongsheng Yang ◽  
Shu Sun ◽  
Yamin Zhou ◽  
Octavian Postolache ◽  
...  
Keyword(s):  
Path Planning ◽  
Control Strategy ◽  
Search Algorithm ◽  
Waiting Times ◽  
Optimal Path ◽  
Speed Control ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Operating Efficiency ◽  
Continuous Increase

With the continuous increase in labour costs and the demands of the supply chain, improving the efficiency of automated container terminals has been a key factor in the development of ports. Automated guided vehicles (AGVs) are the main means of horizontal transport in such terminals, and problems in relation to their use such as vehicle conflict, congestion and waiting times have become very serious, greatly reducing the operating efficiency of the terminals. In this article, we model the minimum driving distance of AGVs that transport containers between quay cranes (QCs) and yard cranes (YCs). AGVs are able to choose the optimal path from pre-planned paths by testing the overlap rate and the conflict time. To achieve conflict-free AGV path planning, a priority-based speed control strategy is used in conjunction with the Dijkstra depth-first search algorithm to solve the model. The simulation experiments show that this model can effectively reduce the probability of AGVs coming into conflict, reduce the time QCs and YCs have to wait for their next task and improve the operational efficiency of AGV horizontal transportation in automated container terminals.

scholarly journals A Method for Obtaining Optimal Path in Angle and Avoiding Collision for Robotic Belt Grinding

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Tie Zhang ◽  
Xiaohong Liang ◽  
Ye Yu ◽  
Bin Zhang
Keyword(s):  
Coordinate System ◽  
Search Algorithm ◽  
Optimal Path ◽  
Recursive Method ◽  
Coordinate Plane ◽  
Angular Variation ◽  
Belt Grinding ◽  
Robotic Grinding ◽  
Path Search ◽  
Robotic Belt Grinding

The angular variation of the joints may be large, and collision between workpieces and tools may occur in robotic grinding. Therefore, this paper proposes an optimal robotic grinding path search algorithm based on the recursive method. The algorithm is optimized by changing the position of the tool coordinate system on the belt wheel; thus, the pose of the robot during grinding is adjusted. First, the position adjustment formula of the tool coordinate system is proposed, and a coordinate plane is established to describe the grinding path of the robot based on the position adjustment formula. Second, the ordinate value of this coordinate plane is dispersed to obtain the search field of the optimal robotic grinding path search algorithm. Third, an optimal robotic grinding path search algorithm is proposed based on the recursive method and single-step search process. Finally, the algorithm is implemented on the V-REP platform. Robotic grinding paths for V-shaped workpieces and S-shaped workpieces are generated using this algorithm, and a grinding experiment is performed. The experimental results show that the robotic grinding paths generated by this algorithm can smoothly complete grinding operations and feature a smaller angular variation of the joint than other methods and no collision.

scholarly journals Picking Path Optimization of Agaricus bisporus Picking Robot

2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Xiaomei Hu ◽  
Zhaoren Pan ◽  
Shunke Lv
Keyword(s):  
Field Experiments ◽  
Search Algorithm ◽  
Optimal Path ◽  
Temperature Drop ◽  
Optimization Method ◽  
Labor Cost ◽  
Path Optimization ◽  
Parallel Optimization ◽  
Storage Location ◽  
Short Time

The design and application of the mushroom picking robot will greatly reduce the labor cost, and it has become one of the research hotspots in the world. Therefore, we independently developed an A. bisporus (a kind of mushroom) picking robot and introduced its functional principle in this paper. At the same time, in order to improve the picking efficiency of the picking robot, a picking path optimization algorithm based on TSP model is proposed. Firstly, based on the TSP model, a picking route model for A. bisporus was established to determine the storage location of each A. bisporus. Then, an improved simulated annealing (I-SA) search algorithm is proposed to find the optimal path sequence. By improving the path initialization module, path generation module, and temperature drop module, the I-SA search algorithm can optimize the picking path in a short time. Finally, in order to improve the stability and reduce the running time of the I-SA search algorithm, a parallel optimization method for global search (“rough exploration”) and local search (“precision exploration”) is proposed. Through simulation experiments, the I-SA search algorithm can search stable and excellent path solution in a relatively short time. Through field experiments on mushroom base, the efficiency of picking A. bisporus can be improved by 14% to 18%, which verifies the effectiveness of the I-SA search algorithm.

Sign in / Sign up

Export Citation Format

Share Document