Filters








11,572 Hits in 9.5 sec

An information theoretic based integer linear programming approach for the discrete search path planning problem

Jean Berger, Nassirou Lo, Abdeslem Boukhtouta, Martin Noel
2015 Optimization Letters  
Departing from traditional nonlinear model formulations, a novel information-theoretic -based approach using integer linear programming (ILP) is proposed to optimally solve the discrete open-loop centralized  ...  Discrete search path planning is known to be a NP-Hard problem, and problem-solving methods proposed so far rely on heuristics with no way to reasonably estimate solution quality for practical size problems  ...  In this paper, we propose a new information-theoretic -based integer linear programming approach to solve the discrete open-loop centralized search path planning problem with anticipated feedback.  ... 
doi:10.1007/s11590-015-0874-7 fatcat:tenhgnro5vhlnfb5l7j4hhc7bq

Exact Solution for Search-and-Rescue Path Planning

Jean Berger, Nassirou Lo, Martin Noel
2013 International Journal of Computer and Communication Engineering  
A new mixed-integer linear programming (MIP) formulation is proposed to optimally solve the single agent discrete search and rescue (SAR) path planning problem.  ...  Discrete search and rescue path planning is known to be hard, and problem-solving techniques proposed so far mainly fail to properly assess optimality gap for practical size problems.  ...  Mathematical Modeling A mathematical mixed-integer linear programming formulation is proposed for the discrete stationary target search and rescue (SAR) path planning problem.  ... 
doi:10.7763/ijcce.2013.v2.185 fatcat:pylhwrpqbbdhri4my3pakqtsm4

An innovative multi-agent search-and-rescue path planning approach

Jean Berger, Nassirou Lo
2015 Computers & Operations Research  
A mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-agent discrete search and rescue (SAR) path planning problem, maximizing cumulative probability of success  ...  Search and rescue path planning is known to be computationally hard, and most techniques developed to solve practical size problems have been unsuccessful to estimate an optimality gap.  ...  In this paper, we propose a new exact mixed-integer linear programming formulation to optimally solve the multi-agent discrete search path planning problem for a stationary object.  ... 
doi:10.1016/j.cor.2014.06.016 fatcat:gpncaiikxrddzjsyjsi65uymqu

A New Multi-Target, Multi-Agent Search-And-Rescue Path Planning Approach

Jean Berger, Nassirou Lo, Martin Noel
2014 Zenodo  
A novel mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-target multi-agent discrete search and rescue (SAR) path planning problem.  ...  Perfectly suited for natural or man-made emergency and disaster management situations such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a team of rescue agents is  ...  Mathematical Modeling A mathematical mixed-integer linear programming (MIP) formulation is proposed for the discrete stationary multi-target search and rescue (SAR) path planning problem.  ... 
doi:10.5281/zenodo.1093289 fatcat:fkz3e3lkhbhs3awqxuf3neeq3i

Path-Planning with Avoidance Using Nonlinear Branch-and-Bound Optimization

Alison J. Eele, Arthur Richards
2009 Journal of Guidance Control and Dynamics  
The best of these branching strategies has been compared with an existing mixed-integer linear programming approach and demonstrated a significant improvement on mixed-integer linear programming solve  ...  The mixed-integer linear programming (MILP) [18] approach uses indirect branch-and-bound optimization, reformulating the problem in linearized form and using powerful commercial software to solve the MILP  ... 
doi:10.2514/1.40034 fatcat:wroqijbyjna7hieqi7z6yemioi

Game Theory for Unmanned Vehicle Path Planning in the Marine Domain: State of the Art and New Possibilities

Marco Cococcioni, Lorenzo Fiaschi, Pierre F. J. Lermusiaux
2021 Journal of Marine Science and Engineering  
There has thus been a commensurate number of approaches and methods to optimize this kind of path planning.  ...  To achieve autonomy in such highly dynamic uncertain conditions, many types of autonomous path planning problems need to be solved.  ...  space for the attacker; it implements an efficient linear-programming-based solution that uses a compact representation for the defender's mixed strategy, while accurately modeling the attacker's continuous  ... 
doi:10.3390/jmse9111175 fatcat:3v6oyeo4yfgcvatahm5rki456u

Learning to Search via Retrospective Imitation [article]

Jialin Song, Ravi Lanka, Albert Zhao, Aadyot Bhatnagar, Yisong Yue, Masahiro Ono
2019 arXiv   pre-print
We study the problem of learning a good search policy for combinatorial search spaces.  ...  We showcase the effectiveness of our approach on a range of tasks, including synthetic maze solving and combinatorial problems expressed as integer programs.  ...  Environments and Datasets Both environments, A* search and integer program based risk-aware path planning, have combinatorial search spaces.  ... 
arXiv:1804.00846v4 fatcat:pw4vb2mi6ffppoct3wsdmceo4y

George Dantzig's impact on the theory of computation

Richard M. Karp
2008 Discrete Optimization  
George Dantzig created the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century.  ...  of the simplex algorithm and the intrinsic complexity of linear programming and combinatorial optimization.  ...  Acknowledgement Many thanks to Ilan Adler for general advice and in particular for recreating for me his experiences as George Dantzig's Ph.D. student at Stanford.  ... 
doi:10.1016/j.disopt.2006.12.004 fatcat:ottc2vlxknbvxbzajpoidab7ri

Essays on OR in ALIO country members (part 1)

Laureano F. Escudero, Antonio Alonso-Ayuso, Nelson Maculan
2020 TOP - An Official Journal of the Spanish Society of Statistics and Operations Research  
for local search) for finding a global minima of nonlinear discrete functions, and a new discrete filled function.  ...  Scolnik in "An augmented filled function for global nonlinear integer optimization" present an approach that does not depend on a particular local optimization method (as e.g., the steepest descent one  ... 
doi:10.1007/s11750-020-00583-w fatcat:q66ey6c6fzeajh2wnknskl5x7u

A practical approach to project scheduling: considering the potential quality loss cost in the time–cost tradeoff problem

JongYul Kim, ChangWook Kang, InKeuk Hwang
2012 International Journal of Project Management  
We propose a mixed integer linear programming model that considers the PQLC for excessive crashing activities. This model will help project planners develop practical project schedules. Crown  ...  However, implementing project scheduling that takes into account the potential quality loss cost (PQLC) in time-cost tradeoff problems is a practical approach, since individual activity quality is defined  ...  Previous approaches to solving the project duration problem include mixed integer linear programming formulations (Wiest, 1963) and linear programming with integer variables (Brucker and Knust, 2006  ... 
doi:10.1016/j.ijproman.2011.05.004 fatcat:rfstinxlazbrjmtbxbimlb37y4

Planning and Operations Research (Dagstuhl Seminar 18071)

J. Christopher Beck, Daniele Magazzeni, Gabriele Röger, Willem-Jan Van Hoeve, Michael Wagner
2018 Dagstuhl Reports  
While this difference results in problems in different complexity classes, it is often possible to cast the same problem as an OR, CP, or planning problem.  ...  of artificial intelligence where the emphasis was traditionally more on symbolic and logical search techniques for the intelligent selection and sequencing of actions to achieve a set of goals.  ...  Finally, I presented a comparison of various solving approaches, namely the Picat system, pure SAT-based solver, ASP, and search-based solver for multi-agent path finding.  ... 
doi:10.4230/dagrep.8.2.26 dblp:journals/dagstuhl-reports/BeckMRH18 fatcat:lavt5jfujfarfmtwrpbbxan2oq

Retrospective on optimization

Lorenz T. Biegler, Ignacio E. Grossmann
2004 Computers and Chemical Engineering  
We then provide a review of solution methods of the major types of optimization problems for continuous and discrete variable optimization, particularly nonlinear and mixed-integer nonlinear programming  ...  In this paper, we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which these problems have been typically applied in  ...  As for discrete problems, they are first classified into mixed-integer linear programming (MILP) and MINLP.  ... 
doi:10.1016/j.compchemeng.2003.11.003 fatcat:4y43k7pcufh47jzdkm32enkx3a

A toolbox for the design, planning and operation of manufacturing networks in a mass customisation environment

Dimitris Mourtzis, Michalis Doukas, Foivos Psarommatis
2015 Journal of manufacturing systems  
The Tabu Search and Simulated Annealing metaheuristic methods are used together with an Artificial Intelligence method, called Intelligent Search Algorithm.  ...  The task of design, planning and operation of manufacturing networks is becoming more and more challenging for companies, as globalisation, mass customisation and the turbulent economic landscape create  ...  A mixed integer linear programming formulation is presented in [14] for the design and planning of closed-loop supply chains that include the phases of production, distribution and reverse logistics.  ... 
doi:10.1016/j.jmsy.2014.06.004 fatcat:xzheiuor7rbvzeg4ob7qkmuhae

Minimal specification revision for weighted transition systems

Kangjin Kim, Georgios Fainekos
2013 2013 IEEE International Conference on Robotics and Automation  
In order to provide exact solutions to the problem, we present an Integer Linear Program (ILP) and a Mixed-Integer Linear Program (MILP) formulation for different versions of the problem.  ...  In this paper, we study the problem of revising Linear Temporal Logic (LTL) formulas that capture specifications for optimal planning over weighted transition systems.  ...  Acknowledgments: The authors would like to thank A. Agung Julius for recommending taking a linear programming approach.  ... 
doi:10.1109/icra.2013.6631151 dblp:conf/icra/KimF13 fatcat:yadrbjo5l5cjvi3juqau3tecry

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  We discuss some useful theoretical properties of the model and outline an integer programming based solution strategy.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa
« Previous Showing results 1 — 15 out of 11,572 results