Open Area Path Finding to Improve Wheelchair Navigation

• URL: http://arxiv.org/abs/2011.03850v1
• Date: Sat, 7 Nov 2020 21:20:32 GMT
• Title: Open Area Path Finding to Improve Wheelchair Navigation
• Authors: Anahid Basiri
• Abstract summary: This paper proposes and implements a novel path finding algorithm for open areas with no network of pathways. The proposed algorithm creates a new graph in the open area, which can consider the obstacles and barriers and calculate the path. The implementations and tests show at least a 76.4% similarity between the proposed algorithm outputs and actual wheelchair users trajectories.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Navigation is one of the most widely used applications of the Location Based Services (LBS) which have become part of our digitally informed daily lives. Navigation services, however, have generally been designed for drivers rather than other users such as pedestrians or wheelchair users. For these users the directed networks of streets and roads do not limit their movements, but their movements may have other limitations, including lower speed of movement, and being more dependent on weather and the pavement surface conditions. This paper proposes and implements a novel path finding algorithm for open areas, i.e. areas with no network of pathways such as grasslands and parks where the conventional graph-based algorithms fail to calculate a practically traversable path. The new method provides multimodality, a higher level of performance, efficiency, and user satisfaction in comparison with currently available solutions. The proposed algorithm creates a new graph in the open area, which can consider the obstacles and barriers and calculate the path based on the factors that are important for wheelchair users. Factors, including slope, width, and surface condition of the routes, are recognised by mining the actual trajectories of wheelchairs users using trajectory mining and machine learning techniques. Unlike raster-based techniques, a graph-based open area path finding algorithm allows the routing to be fully compatible with current transportation routing services, and enables a full multimodal routing service. The implementations and tests show at least a 76.4% similarity between the proposed algorithm outputs and actual wheelchair users trajectories.

Related papers

• PathwayBench: Assessing Routability of Pedestrian Pathway Networks Inferred from Multi-City Imagery [15.563635571840733]
  Application to support pedestrian mobility in urban areas requires a complete, and routable graph representation of the built environment. Relative to road network pathways, pedestrian network pathways are narrower, more frequently disconnected, often visually and materially variable in smaller areas. Existing algorithms to extract pedestrian pathway network graphs are inconsistently evaluated and tend to ignore routability.
  arXiv  Detail & Related papers  (2024-07-23T22:47:32Z)
• AI Algorithm for the Generation of Three-Dimensional Accessibility Ramps in Grasshopper / Rhinoceros 7 [0.0]
  We present an algorithm capable of the automatic generation of a feasible accessibility ramp based on a 3D model of the relevant environment. The algorithm uses AI search algorithms to determine the optimal pathway connecting these points. Essential components in devising a wheelchair-accessible ramp are encoded within the process, as evaluated by the algorithm.
  arXiv  Detail & Related papers  (2023-09-29T04:54:51Z)
• Short Run Transit Route Planning Decision Support System Using a Deep Learning-Based Weighted Graph [0.0]
  We propose a novel deep learning-based methodology for a decision support system that enables public transport planners to identify short-term route improvements rapidly. By seamlessly adjusting specific sections of routes between two stops during specific times of the day, our method effectively reduces times and enhances PT services. Using self-supervision, we train a deep learning model for predicting lateness values for road segments. These lateness values are then utilized as edge weights in the transportation graph, enabling efficient path searching.
  arXiv  Detail & Related papers  (2023-08-24T14:37:55Z)
• Efficient Ground Vehicle Path Following in Game AI [77.34726150561087]
  This paper presents an efficient path following solution for ground vehicles tailored to game AI. The proposed path follower is evaluated through a variety of test scenarios in a first-person shooter game. We achieved a 70% decrease in the total number of stuck events compared to an existing path following solution.
  arXiv  Detail & Related papers  (2023-07-07T04:20:07Z)
• GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation [93.60478281489243]
  We propose a learnable network to approximate geodesic paths on 3D surfaces. The proposed method provides efficient approximations of the shortest paths and geodesic distances estimations.
  arXiv  Detail & Related papers  (2022-05-30T16:22:53Z)
• WayFAST: Traversability Predictive Navigation for Field Robots [5.914664791853234]
  We present a self-supervised approach for learning to predict traversable paths for wheeled mobile robots. Our key inspiration is that traction can be estimated for rolling robots using kinodynamic models. We show that our training pipeline based on online traction estimates is more data-efficient than other-based methods.
  arXiv  Detail & Related papers  (2022-03-22T22:02:03Z)
• Systematic Comparison of Path Planning Algorithms using PathBench [55.335463666037086]
  Path planning is an essential component of mobile robotics. Development of learning-based path planning algorithms has been experiencing rapid growth. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2022-03-07T01:52:57Z)
• Hybrid Graph Embedding Techniques in Estimated Time of Arrival Task [0.06445605125467574]
  Estimated Time of Arrival (ETA) is considered as predicting the travel time from the start point to a certain place along a given path. ETA plays an essential role in intelligent taxi services or automotive navigation systems. This research explores the generalization ability of different spatial embedding strategies and proposes a two-stage approach to deal with such problems.
  arXiv  Detail & Related papers  (2021-10-08T16:29:55Z)
• Road Network Guided Fine-Grained Urban Traffic Flow Inference [108.64631590347352]
  Accurate inference of fine-grained traffic flow from coarse-grained one is an emerging yet crucial problem. We propose a novel Road-Aware Traffic Flow Magnifier (RATFM) that exploits the prior knowledge of road networks. Our method can generate high-quality fine-grained traffic flow maps.
  arXiv  Detail & Related papers  (2021-09-29T07:51:49Z)
• SPIN Road Mapper: Extracting Roads from Aerial Images via Spatial and Interaction Space Graph Reasoning for Autonomous Driving [64.10636296274168]
  Road extraction is an essential step in building autonomous navigation systems. Using just convolution neural networks (ConvNets) for this problem is not effective as it is inefficient at capturing distant dependencies between road segments in the image. We propose a Spatial and Interaction Space Graph Reasoning (SPIN) module which when plugged into a ConvNet performs reasoning over graphs constructed on spatial and interaction spaces projected from the feature maps.
  arXiv  Detail & Related papers  (2021-09-16T03:52:17Z)
• PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms [59.3879573040863]
  Path planning is a key component in mobile robotics. Few attempts have been made to benchmark the algorithms holistically or unify their interface. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2021-05-04T21:48:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.