untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-15T18:41:51Z</responseDate>
<request identifier=oai:HAL:hal-00634752v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00634752v1</identifier>
<datestamp>2018-01-11</datestamp>
<setSpec>type:COMM</setSpec>
<setSpec>subject:info</setSpec>
<setSpec>collection:UNIV-TLSE2</setSpec>
<setSpec>collection:UNIV-TLSE3</setSpec>
<setSpec>collection:CNRS</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:SMS</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=it>Integrating Orbit Database And Metaheuristics To Design Satellite Constellation</title>
<creator>Grandchamp, Enguerran</creator>
<creator>Vincent, Charvillat</creator>
<contributor>Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<contributor>Institut de recherche en informatique de Toulouse (IRIT) ; Institut National Polytechnique [Toulouse] (INP) - Université Toulouse 1 Capitole (UT1) - Université Toulouse 2 (UT2) - Université Paul Sabatier - Toulouse 3 (UPS) - Centre National de la Recherche Scientifique (CNRS)</contributor>
<description>International audience</description>
<source>ICAI Proceeding</source>
<source>ICAI</source>
<identifier>hal-00634752</identifier>
<identifier>https://hal.archives-ouvertes.fr/hal-00634752</identifier>
<source>https://hal.archives-ouvertes.fr/hal-00634752</source>
<source>ICAI, Jul 2000, United States. pp.00, 2000</source>
<language>en</language>
<subject>[INFO.INFO-TI] Computer Science [cs]/Image Processing</subject>
<type>info:eu-repo/semantics/conferenceObject</type>
<type>Conference papers</type>
<description lang=en>The method we propose is a new approach to the problem of extbf{satellite constellation design}. The main difficulties of this field are the size of the solution space, the computation time of the optimization criterion and the lack of information to analyse and improve a solution. Our model bypasses some of these obstacles by using an extbf{inverse approach} where services to be fulfilled are highlighted. The algorithm is composed of different layers solving different problems. We first use the specifications of the services to compensate for lack of information returned by the criterion to analyse and improve a solution. An orbit database introduces an expert knowledge linked to a robust estimator to set consistent orbital parameters. We use a partial evaluation of the constellation to reduce the criterion computation time. The highest level of the algorithm is a metaheuristic layer that drives the search across the wide solution space with a probabilistic tabu search.</description>
<date>2000-07-01</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
