Constrained optimization with stochastic feasibility regions applied to vehicle path planning
From MaRDI portal
(Redirected from Publication:280102)
Abstract: In real-time trajectory planning for unmanned vehicles, on-board sensors, radars and other instruments are used to collect information on possible obstacles to be avoided and pathways to be followed. Since, in practice, observations of the sensors have measurement errors, the stochasticity of the data has to be incorporated into the models. In this paper, we consider using a genetic algorithm for the constrained optimization problem of finding the trajectory with minimum length between two locations, avoiding the obstacles on the way. To incorporate the variability of the sensor readings, we propose a more general framework, where the feasible regions of the genetic algorithm are stochastic. In this way, the probability that a possible solution of the search space, say x, is feasible can be derived from the random observations of obstacles and pathways, creating a real-time data learning algorithm. By building a confidence region from the observed data such that its border intersects with the solution point x, the level of the confidence region defines the probability that x is feasible. We propose using a smooth penalty function based on the Gaussian distribution, facilitating the borders of the feasible regions to be reached by the algorithm.
Recommendations
- Robot path planning in a dynamic environment with stochastic measurements
- Path planning for robots by stochastic optimization methods
- Two-dimensional path finding subject to geometric constraints
- A penalized nonparametric method for nonlinear constrained optimization based on noisy data
- Monte Carlo algorithm for trajectory optimization based on Markovian readings
Cites work
- scientific article; zbMATH DE number 1688594 (Why is no real title available?)
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A penalized nonparametric method for nonlinear constrained optimization based on noisy data
- Chance Constrained Programming with Joint Constraints
- Chance-constrained programming
- Constraint handling in genetic algorithms using a gradient-based repair method
- Efficient algorithms for globally optimal trajectories
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
- Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
- On distributionally robust chance-constrained linear programs
- On mixing sets arising in chance-constrained programming
- Optimization of a continuous distillation process under random inflow rate.
- Optimization of laminate stacking sequence for buckling load maximization by genetic algorithm
- Quantitative Stability in Stochastic Programming: The Method of Probability Metrics
- Stochastic programming in water management: A case study and a comparison of solution techniques
- The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
Cited in
(3)
This page was built for publication: Constrained optimization with stochastic feasibility regions applied to vehicle path planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280102)
