AI Algorithm for the Generation of Three-Dimensional Accessibility Ramps
in Grasshopper / Rhinoceros 7
- URL: http://arxiv.org/abs/2310.07728v1
- Date: Fri, 29 Sep 2023 04:54:51 GMT
- Title: AI Algorithm for the Generation of Three-Dimensional Accessibility Ramps
in Grasshopper / Rhinoceros 7
- Authors: Antonio Li, Leila Yi, Brandon Yeo Pei Hui
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Often overlooked as a component of urban development, accessibility
infrastructure is undeniably crucial in daily life. Accessibility ramps are one
of the most common types of accessibility infrastructure, and serve to benefit
not only people with mobile impairments but also able-bodied third parties.
While the necessity of accessibility ramps is acknowledged, actual
implementation fails in light of the limits of manpower required for the design
stage. In response, we present an algorithm capable of the automatic generation
of a feasible accessibility ramp based on a 3D model of the relevant
environment. Through the manual specification of initial and terminal points
within a 3D model, 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, including but not limited to elevation differentials, spatial
constraints, and gradient specifications. From this, the algorithm then
generates the pathway to be expanded into a full-scale, usable model of a ramp,
which then can be easily exported and transformed through inter-software
exchanges. Though some human input is still required following the generation
stage, the minimising of human resources provides significant boosts of
efficiency in the design process thus lowering the threshold for the
incorporation of accessibility features in future urban design.
Related papers
- OPUS: Occupancy Prediction Using a Sparse Set [64.60854562502523]
We present a framework to simultaneously predict occupied locations and classes using a set of learnable queries.
OPUS incorporates a suite of non-trivial strategies to enhance model performance.
Our lightest model achieves superior RayIoU on the Occ3D-nuScenes dataset at near 2x FPS, while our heaviest model surpasses previous best results by 6.1 RayIoU.
arXiv Detail & Related papers (2024-09-14T07:44:22Z) - Unifying Lane-Level Traffic Prediction from a Graph Structural Perspective: Benchmark and Baseline [21.37853568400125]
This paper extensively analyzes and categorizes existing research in lane-level traffic prediction.
It introduces a simple baseline model, GraphMLP, based on graph structure and prediction networks.
We have replicated codes not publicly available in existing studies and assessed various models in terms of effectiveness, efficiency, and applicability.
arXiv Detail & Related papers (2024-03-22T04:21:40Z) - Edge-Enabled Real-time Railway Track Segmentation [0.0]
We propose an edge-enabled real-time railway track segmentation algorithm.
It is optimized to be suitable for edge applications by optimizing the network structure and quantizing the model after training.
Experimental results demonstrate that our enhanced algorithm achieves an accuracy level of 83.3%.
arXiv Detail & Related papers (2024-01-21T13:45:52Z) - Integrating Higher-Order Dynamics and Roadway-Compliance into
Constrained ILQR-based Trajectory Planning for Autonomous Vehicles [3.200238632208686]
Trajectory planning aims to produce a globally optimal route for Autonomous Passenger Vehicles.
Existing implementations utilizing the vehicle bicycle kinematic model may not guarantee controllable trajectories.
We augment this model by higher-order terms, including the first and second-order derivatives of curvature and longitudinal jerk.
arXiv Detail & Related papers (2023-09-25T22:30:18Z) - BoundED: Neural Boundary and Edge Detection in 3D Point Clouds via Local
Neighborhood Statistics [0.0]
We propose to utilize a novel set of features describing the local neighborhood on a per-point basis via first and second order statistics as input for a simple and compact classification network.
Leveraging this feature embedding enables our algorithm to outperform the state-of-the-art techniques in terms of quality and processing time.
arXiv Detail & Related papers (2022-10-24T14:49:03Z) - Back to MLP: A Simple Baseline for Human Motion Prediction [59.18776744541904]
This paper tackles the problem of human motion prediction, consisting in forecasting future body poses from historically observed sequences.
We show that the performance of these approaches can be surpassed by a light-weight and purely architectural architecture with only 0.14M parameters.
An exhaustive evaluation on Human3.6M, AMASS and 3DPW datasets shows that our method, which we dub siMLPe, consistently outperforms all other approaches.
arXiv Detail & Related papers (2022-07-04T16:35:58Z) - Offline Model-Based Optimization via Normalized Maximum Likelihood
Estimation [101.22379613810881]
We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points.
This problem setting emerges in many domains where function evaluation is a complex and expensive process.
We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
arXiv Detail & Related papers (2021-02-16T06:04:27Z) - Reconfigurable Intelligent Surface Assisted Mobile Edge Computing with
Heterogeneous Learning Tasks [53.1636151439562]
Mobile edge computing (MEC) provides a natural platform for AI applications.
We present an infrastructure to perform machine learning tasks at an MEC with the assistance of a reconfigurable intelligent surface (RIS)
Specifically, we minimize the learning error of all participating users by jointly optimizing transmit power of mobile users, beamforming vectors of the base station, and the phase-shift matrix of the RIS.
arXiv Detail & Related papers (2020-12-25T07:08:50Z) - Evolving Search Space for Neural Architecture Search [70.71153433676024]
We present a Neural Search-space Evolution (NSE) scheme that amplifies the results from the previous effort by maintaining an optimized search space subset.
We achieve 77.3% top-1 retrain accuracy on ImageNet with 333M FLOPs, which yielded a state-of-the-art performance.
When the latency constraint is adopted, our result also performs better than the previous best-performing mobile models with a 77.9% Top-1 retrain accuracy.
arXiv Detail & Related papers (2020-11-22T01:11:19Z) - Open Area Path Finding to Improve Wheelchair Navigation [0.0]
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.
arXiv Detail & Related papers (2020-11-07T21:20:32Z) - A Privacy-Preserving-Oriented DNN Pruning and Mobile Acceleration
Framework [56.57225686288006]
Weight pruning of deep neural networks (DNNs) has been proposed to satisfy the limited storage and computing capability of mobile edge devices.
Previous pruning methods mainly focus on reducing the model size and/or improving performance without considering the privacy of user data.
We propose a privacy-preserving-oriented pruning and mobile acceleration framework that does not require the private training dataset.
arXiv Detail & Related papers (2020-03-13T23:52:03Z)
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.