Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Computational load reduction of the agent guidance problem using Mixed Integer Programming

Texto completo
Autor(es):
Battagello, Vinicius Antonio [1] ; Soma, Nei Yoshihiro [1] ; Afonso, Rubens Junqueira Magalhaes [2, 3]
Número total de Autores: 3
Afiliação do(s) autor(es):
[1] Inst Tecnolo Aeronaut, Div Engn Comp, Sao Jose Dos Campos, SP - Brazil
[2] Inst Tecnolo Aeronaut, Div Engn Eletron, Sao Jose Dos Campos, SP - Brazil
[3] Tech Univ Munich, Inst Flight Syst Dynam, Garching, Bavaria - Germany
Número total de Afiliações: 3
Tipo de documento: Artigo Científico
Fonte: PLoS One; v. 15, n. 6 JUN 5 2020.
Citações Web of Science: 0
Resumo

This paper employs a solution to the agent-guidance problem in an environment with obstacles, whose avoidance techniques have been extensively used in the last years. There is still a gap between the solution times required to obtain a trajectory and those demanded by real world applications. These usually face a tradeoff between the limited on-board processing performance and the high volume of computing operations demanded by those real-time applications. In this paper we propose a deferred decision-based technique that produces clusters used for obstacle avoidance as the agent moves in the environment, like a driver that, at night, enlightens the road ahead as her/his car moves along a highway. By considering the spatial and temporal relevance of each obstacle throughout the planning process and pruning areas that belong to the constrained domain, one may relieve the inherent computational burden of avoidance. This strategy reduces the number of operations required and increases it on demand, since a computationally heavier problem is tackled only if the simpler ones are not feasible. It consists in an improvement based solely on problem modeling, which, by example, may offer processing times in the same order of magnitude than the lower-bound given by the relaxed form of the problem. (AU)

Processo FAPESP: 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos
Beneficiário:Reinaldo Morabito Neto
Modalidade de apoio: Auxílio à Pesquisa - Temático