| dc.creator | Zambom | |
| dc.creator | AZ; Collazos | |
| dc.creator | JAA; Dias | |
| dc.creator | R | |
| dc.date | 2016 | |
| dc.date | 2016-12-06T18:30:39Z | |
| dc.date | 2016-12-06T18:30:39Z | |
| dc.date.accessioned | 2018-03-29T02:03:13Z | |
| dc.date.available | 2018-03-29T02:03:13Z | |
| dc.identifier | 1573-2916 | |
| dc.identifier | Journal Of Global Optimization. SPRINGER, n. 64, n. 4, p. 803 - 823. | |
| dc.identifier | 0925-5001 | |
| dc.identifier | WOS:000373017300011 | |
| dc.identifier | 10.1007/s10898-015-0353-9 | |
| dc.identifier | http://link-springer-com.ez88.periodicos.capes.gov.br/article/10.1007%2Fs10898-015-0353-9 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/320089 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1310855 | |
| dc.description | 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 modified genetic algorithm, addressing the stochasticity of the feasible regions. In this way, the probability that a possible solution in 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. | |
| dc.description | 64 | |
| dc.description | 803 | |
| dc.description | 823 | |
| dc.description | 11th International Symposium on Generalized Convexity and Monotonicity | |
| dc.description | AUG 25-30, 2014 | |
| dc.description | IMPA, Rio de Janeiro, BRAZIL | |
| dc.language | English | |
| dc.publisher | SPRINGER | |
| dc.publisher | DORDRECHT | |
| dc.relation | Journal of Global Optimization | |
| dc.rights | fechado | |
| dc.source | WOS | |
| dc.subject | Constrained Optimization | |
| dc.subject | Stochastic Feasible Regions | |
| dc.subject | Penalty Function | |
| dc.subject | Autonomous Vehicle | |
| dc.subject | Nonparametric Curve Estimation | |
| dc.title | Constrained Optimization With Stochastic Feasibility Regions Applied To Vehicle Path Planning | |
| dc.type | Artículos de revistas | |
