Pasar al contenido principal

BIFURCACIONES Y COMPLEJIDAD DINAMICA EN SISTEMAS DE EVOLUCION TEMPORAL

MTM2012-31821

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSIDAD DE SEVILLA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming

  • Vazquez, Rafael
  • Perea Rojas Marcos, Federico
  • Galán Vioque, Jorge
Every day, ground stations need to manage numerous requests for allocation of antenna time slots by customers operating satellites. For multi-antenna, multi-site ground networks serving numerous satellite operators, oftentimes these requests yield conflicts, which arise when two or more satellites request overlapping time slots on the same antenna. Deconflicting is performed by moving passes to other antennas, shortening their duration, or canceling them, and has frequently been done manually. However, when many conflicts are present, deconflicting becomes a complex and time-consuming when done manually. We propose an automated tool that solves the problem by means of Integer Linear Programming. The models include operational constraints and mimic the manual process but consider the problem globally, thus being able to improve the quality of the solution. A simplified shortening model is also included to avoid excessive computation times, which is crucial given that the general problem has been reported NP-complete. Priorities are taken into account by tuning the cost function according to specifications of the requesting clients. Experiments with real-data scenarios using open-source software show that our tool is able to solve the Antenna Satellite assignment problem for a large number of passes in a short amount of time, thus enormously improving manual scheduling operations, even when performed by a skilled operator., The authors gratefully acknowledge the cooperation of Taitus Software (http://www.taitussoftware.com) and its team, and in particular its founder and CEO (Felipe Martin Crespo), which introduced this problem to us and provided integration with its orbital mechanics visual software SaVoir. We also acknowledge the cooperation of Kongsberg Satellite Services AS (KSAT). Jorge Galan acknowledges financial support through grants MTM2012-31821 and P12-FQM-1658. Federico Perea acknowledges financial support through grants FQM-5849 and P09-TEP-5022 (Junta de Andalucia and FEDER) and MTM2010-19576-C02-01 and MTM2013-46962-C2-1 (MICINN, Spain). Special thanks are due to three anonymous referees for their valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Swath-Acquisition Planning in Multiple-Satellite Missions: An Exact and Heuristic Approach

  • Perea Rojas Marcos, Federico
  • Vázquez, Rafael
  • Galán-Vioque, Jorge
[EN] This paper deals with the swath acquisition planning problem for multisatellite Earth observation missions. Given a set of satellites and a mission time frame, the problem we solve consists of selecting a set of acquisitions from the satellites in order to cover a given region of interest during the requested time frame, optimizing a certain objective function. We show that the planning problem can be modeled as a set covering problem, using basic tools of mathematical programming. The formulation of the model requires the solution of a complex computational geometry problem, and therefore the use of heuristics and metaheuristics applies. In this paper, we discuss the efficiency of the constructive phase of a greedy randomized adaptive search procedure algorithm. Computational results comparing the heuristic algorithms with the exact approach are presented., JGV acknowledges financial support from grant MTM2012-31821 and P12-FQM-1658, and FP from grants FQM-5849, P09-TEP-5022, and MTM2010-19576-C02-01.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A simple solution to the Braga-Mello conjecture

  • Novaes, Douglas D.|||0000-0002-9147-8442
  • Ponce, Enrique|||0000-0003-0467-5032
Recently Braga and Mello conjectured that for a given n N there is a piecewise linear system with two zones in the plane with exactly n limit cycles. In this paper, we prove a result from which the conjecture is an immediate consequence. Several explicit examples are given where location and stability of limit cycles are provided.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Uniqueness and Non-uniqueness of Limit Cycles for Piecewise Linear Differential Systems with Three Zones and No Symmetry, Limit cycles of piecewise linear differential systems with three zones and symmet

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ponce, Enrique|||0000-0003-0467-5032
  • Valls, Clàudia|||0000-0001-8279-1229
Some techniques for proving the existence and uniqueness of limit cycles for smooth differential systems are extended to continuous piecewise linear differential systems with two and three zones and no symmetry. For planar systems with three linearity zones, the existence of two limit cycles surrounding the only equilibrium point at the origin is rigorously shown for the first time. The usefulness of the achieved analytical results is illustrated by considering non-symmetric memristor-based electronic oscillators.