On multi-robot search for a stationary object
Two variants of multi-robot search for a stationary object in a priori known environment represented by a graph are studied in the paper. The first one is generalization of the Traveling Deliveryman Problem where more than one deliveryman is allowed to be used in a solution. Similarly, the second va...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
Institute of Electrical and Electronics Engineers Inc.
2017
|
| Materias: | |
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 07918caa a22007457a 4500 | ||
|---|---|---|---|
| 001 | PAPER-17467 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518204842.0 | ||
| 008 | 190410s2017 xx ||||fo|||| 10| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-85040722869 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Kulich, M. | |
| 245 | 1 | 3 | |a On multi-robot search for a stationary object |
| 260 | |b Institute of Electrical and Electronics Engineers Inc. |c 2017 | ||
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a Kulich, M., Preucil, L., Miranda-Bront, J.J., Single Robot Search for a Stationary Object in an Unknown Environment (2014) Robotics and Automation (ICRA), IEEE Int. Conf. on, pp. 5830-5835 | ||
| 504 | |a Afrati, F., Cosmadakis, S., Papadimitriou, C.H., Papageorgiou, G., Papakostantinou, N., The complexity of the travelling repairman problem (1986) Theoretical Informatics and Applications | ||
| 504 | |a Gouveia, L., Voß, S., A classification of formulations for the (time-dependent) traveling salesman problem (1995) European Journal of Operational Research, 2217 (93) | ||
| 504 | |a Mendez-Diaz, I., Zabala, P., Lucena, A., A new formulation for the traveling deliveryman problem (2008) Discrete Appl. Math., 156 (17), pp. 3223-3237. , Oct | ||
| 504 | |a Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E., The time dependent traveling salesman problem: Polyhedra and algorithm (2012) Mathematical Programming Computation, 5 (1), pp. 27-55. , Sept | ||
| 504 | |a Miranda-Bront, J.J., Mendez-Diaz, I., Zabala, P., Facets and valid inequalities for the time-dependent travelling salesman problem (2013) European Journal of Operational Research, , May | ||
| 504 | |a Godinho, M.T., Gouveia, L., Pesneau, P., Natural and extended formulations for the time-dependent traveling salesman problem (2014) Discrete Applied Mathematics, 164, pp. 138-153. , Feb | ||
| 504 | |a Feo, T.A., Resende, M.G., Greedy randomized adaptive search procedures (1995) Journal of Global Optimization, 6 (2), pp. 109-133 | ||
| 504 | |a Hansen, P., Mladenovic, N., Variable neighborhood search (1997) Computers &Operations Research, 24 (1), pp. 1097-1100 | ||
| 504 | |a Salehipour, A., Sorensen, K., Goos, P., Braysy, O., Efficient grasp+vnd and grasp+vns metaheuristics for the traveling repairman problem (2011) 4OR, 9, pp. 189-209 | ||
| 504 | |a Mladenovic, N., Urosevic, D., Hanafi, S., Variable neighborhood search for the travelling deliveryman problem (2012) 4OR, pp. 1-17 | ||
| 504 | |a Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S., A simple and effective metaheuristic for the Minimum Latency Problem (2012) European Journal of Operational Research, 221 (3), pp. 513-520 | ||
| 504 | |a Sarmiento, A., Murrieta-Cid, R., Hutchinson, S., A multi-robot strategy for rapidly searching a polygonal environment (2004) Advances in Artificial Intelligence-IBERAMIA 2004, Ser. Lecture Notes in Computer Science, 3315, pp. 484-493. , , C. Lematre, C. A. Reyes, and J. A. Gonzlez, Eds.Springer | ||
| 504 | |a Koutsoupias, E., Papadimitriou, C., Yannakakis, M., Searching a fixed graph (1996) Automata, Languages and Programming, Ser. Lecture Notes in Computer Science, 1099, pp. 280-289. , F. Meyer and B. Monien, Eds. Springer Berlin Heidelberg | ||
| 504 | |a Ausiello, G., Leonardi, S., Marchetti-Spaccamela, A., On salesmen, repairmen, spiders, and other traveling agents (2000) Algorithms and Complexity, Ser. Lecture Notes in Computer Science, 1767, pp. 1-16. , G. Bongiovanni, R. Petreschi, and G. Gambosi, Eds. Springer Berlin Heidelberg | ||
| 504 | |a Kulich, M., Miranda-Bront, J.J., Preucil, L., A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (2016) Computers &Operations Research, , in press | ||
| 504 | |a Sathyan, A., Boone, N., Cohen, K., Comparison of approximate approaches to solving the travelling salesman problem and its application to uav swarming (2015) International Journal of Unmanned Systems Engineering, 3 (1), pp. 1-16 | ||
| 504 | |a Boone, N., Sathyan, A., Cohen, K., Enhanced approaches to solving the multiple traveling salesman problem (2015) AIAA Infotech@ Aerospace, , American Institute of Aeronautics and Astronautics | ||
| 504 | |a Geetha, S., Poonthalir, G., Vanathi, P., Improved k-means algorithm for capacitated clustering problem (2009) INFOCOMP Journal of Computer Science, 8 (4), pp. 52-59 | ||
| 504 | |a Faigl, J., Kulich, M., Preucil, L., Goal assignment using distance cost in multi-robot exploration (2012) Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ Int. Conf. on, pp. 3741-3746. , oct | ||
| 504 | |a Reinelt, G., Tsplib-A traveling salesman problem library (1991) INFORMS Journal on Computing, 3 (4), pp. 376-384 | ||
| 504 | |a Lin, S., Kernighan, B., An effective heuristic algorithm for the traveling-salesman problem (1973) Operations Research | ||
| 504 | |a Arthur, D., Vassilvitskii, S., K-means++: The advantages of careful seeding (2007) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Ser. SODA '07, pp. 1027-1035. , Philadelphia, PA, USA: Society for Industrial and Applied MathematicsA4 - | ||
| 520 | 3 | |a Two variants of multi-robot search for a stationary object in a priori known environment represented by a graph are studied in the paper. The first one is generalization of the Traveling Deliveryman Problem where more than one deliveryman is allowed to be used in a solution. Similarly, the second variant is generalization of the Graph Search Problem. A novel heuristics suitable for both problems is proposed which is furthermore integrated into a cluster-first route second approach. A set of computational experiments was conducted over the benchmark instances derived from the TSPLIB library. The results obtained show that even a standalone heuristics significantly outperforms the standard solution based on k- means clustering in quality of results as well as computational time. The integrated approach furthermore improves solutions found by a standalone heuristics by up to 15% at the expense of higher computational complexity. © 2017 IEEE. |l eng | |
| 593 | |a Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Zikova 1903/4, Prague, 166 36, Czech Republic | ||
| 593 | |a Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina | ||
| 690 | 1 | 0 | |a BENCHMARKING |
| 690 | 1 | 0 | |a INDUSTRIAL ROBOTS |
| 690 | 1 | 0 | |a MOBILE ROBOTS |
| 690 | 1 | 0 | |a MULTIPURPOSE ROBOTS |
| 690 | 1 | 0 | |a COMPUTATIONAL EXPERIMENT |
| 690 | 1 | 0 | |a COMPUTATIONAL TIME |
| 690 | 1 | 0 | |a INTEGRATED APPROACH |
| 690 | 1 | 0 | |a K-MEANS CLUSTERING |
| 690 | 1 | 0 | |a MULTI-ROBOT SEARCH |
| 690 | 1 | 0 | |a STANDARD SOLUTIONS |
| 690 | 1 | 0 | |a STATIONARY OBJECTS |
| 690 | 1 | 0 | |a TRAVELING DELIVERYMAN PROBLEM |
| 650 | 1 | 7 | |2 spines |a ROBOTS |
| 700 | 1 | |a Preucil, L. | |
| 700 | 1 | |a Bront, J.J.M. | |
| 711 | 2 | |d 6 September 2017 through 8 September 2017 |g Código de la conferencia: 132335 | |
| 773 | 0 | |d Institute of Electrical and Electronics Engineers Inc., 2017 |p European Conf. Mob. Robots, ECMR |n 2017 European Conference on Mobile Robots, ECMR 2017 |z 9781538610961 |t 2017 European Conference on Mobile Robots, ECMR 2017 | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040722869&doi=10.1109%2fECMR.2017.8098696&partnerID=40&md5=51b1e6d1ba517121c8240d2a11141f67 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1109/ECMR.2017.8098696 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_97815386_v_n_p_Kulich |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815386_v_n_p_Kulich |y Registro en la Biblioteca Digital |
| 961 | |a paper_97815386_v_n_p_Kulich |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/conferenceObject |a info:ar-repo/semantics/documento de conferencia |b info:eu-repo/semantics/publishedVersion | ||
| 999 | |c 78420 | ||