Ontology type: schema:Chapter
2015
AUTHORSYannick Kenné , François Le Gland , Christian Musso , Sébastien Paris , Yannick Glemarec , Émile Vasta
ABSTRACTTwo simulation–based algorithms are presented, that have been successfully applied to an industrial optimization problem. These two algorithms have different and complementary features. One is fast, and sequential: it proceeds by running a population of targets and by dropping and activating a new sensor (or re–activating a sensor already available) where and when this action seems appropriate. The other is slow, iterative, and non–sequential: it proceeds by updating a population of deployment plans with guaranteed and increasing criterion value at each iteration, and for each given deployment plan, there is a population of targets running to evaluate the criterion. Finally, the two algorithms can cooperate in many different ways, to try and get the best of both approaches. A simple and efficient way is to use the deployment plans provided by the sequential algorithm as the initial population for the iterative algorithm. More... »
PAGES261-272
Modelling, Computation and Optimization in Information Systems and Management Sciences
ISBN
978-3-319-18166-0
978-3-319-18167-7
http://scigraph.springernature.com/pub.10.1007/978-3-319-18167-7_23
DOIhttp://dx.doi.org/10.1007/978-3-319-18167-7_23
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1047894815
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Applied Mathematics",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Universite De Toulon Et Du Var",
"id": "https://www.grid.ac/institutes/grid.12611.35",
"name": [
"Universit\u00e9 de Toulon/LSIS, Toulon, France"
],
"type": "Organization"
},
"familyName": "Kenn\u00e9",
"givenName": "Yannick",
"type": "Person"
},
{
"affiliation": {
"alternateName": "French Institute for Research in Computer Science and Automation",
"id": "https://www.grid.ac/institutes/grid.5328.c",
"name": [
"INRIA, Rennes, France"
],
"type": "Organization"
},
"familyName": "Le Gland",
"givenName": "Fran\u00e7ois",
"id": "sg:person.07757427211.15",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07757427211.15"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Office National d'\u00c9tudes et de Recherches A\u00e9rospatiales",
"id": "https://www.grid.ac/institutes/grid.4365.4",
"name": [
"ONERA, Palaiseau, France"
],
"type": "Organization"
},
"familyName": "Musso",
"givenName": "Christian",
"id": "sg:person.011377561312.36",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011377561312.36"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Universite De Toulon Et Du Var",
"id": "https://www.grid.ac/institutes/grid.12611.35",
"name": [
"Universit\u00e9 de Toulon/LSIS, Toulon, France"
],
"type": "Organization"
},
"familyName": "Paris",
"givenName": "S\u00e9bastien",
"id": "sg:person.014371661147.40",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014371661147.40"
],
"type": "Person"
},
{
"affiliation": {
"name": [
"DGA Techniques navales, Toulon, France"
],
"type": "Organization"
},
"familyName": "Glemarec",
"givenName": "Yannick",
"id": "sg:person.013011135417.54",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013011135417.54"
],
"type": "Person"
},
{
"affiliation": {
"name": [
"DGA Techniques navales, Toulon, France"
],
"type": "Organization"
},
"familyName": "Vasta",
"givenName": "\u00c9mile",
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/s11009-008-9073-7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1002752311",
"https://doi.org/10.1007/s11009-008-9073-7"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-29124-1_21",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1008145367",
"https://doi.org/10.1007/978-3-642-29124-1_21"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/34.1000236",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061155588"
],
"type": "CreativeWork"
}
],
"datePublished": "2015",
"datePublishedReg": "2015-01-01",
"description": "Two simulation\u2013based algorithms are presented, that have been successfully applied to an industrial optimization problem. These two algorithms have different and complementary features. One is fast, and sequential: it proceeds by running a population of targets and by dropping and activating a new sensor (or re\u2013activating a sensor already available) where and when this action seems appropriate. The other is slow, iterative, and non\u2013sequential: it proceeds by updating a population of deployment plans with guaranteed and increasing criterion value at each iteration, and for each given deployment plan, there is a population of targets running to evaluate the criterion. Finally, the two algorithms can cooperate in many different ways, to try and get the best of both approaches. A simple and efficient way is to use the deployment plans provided by the sequential algorithm as the initial population for the iterative algorithm.",
"editor": [
{
"familyName": "Le Thi",
"givenName": "Hoai An",
"type": "Person"
},
{
"familyName": "Pham Dinh",
"givenName": "Tao",
"type": "Person"
},
{
"familyName": "Nguyen",
"givenName": "Ngoc Thanh",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-18167-7_23",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-18166-0",
"978-3-319-18167-7"
],
"name": "Modelling, Computation and Optimization in Information Systems and Management Sciences",
"type": "Book"
},
"name": "Simulation\u2013Based Algorithms for the Optimization of Sensor Deployment",
"pagination": "261-272",
"productId": [
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-18167-7_23"
]
},
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"e428ad62fcbd219965abadefa1f7c50d96e2eed738146280f0f22a49cb276902"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1047894815"
]
}
],
"publisher": {
"location": "Cham",
"name": "Springer International Publishing",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-18167-7_23",
"https://app.dimensions.ai/details/publication/pub.1047894815"
],
"sdDataset": "chapters",
"sdDatePublished": "2019-04-16T00:51",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8700_00000273.jsonl",
"type": "Chapter",
"url": "http://link.springer.com/10.1007/978-3-319-18167-7_23"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18167-7_23'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18167-7_23'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18167-7_23'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18167-7_23'
This table displays all metadata directly associated to this object as RDF triples.
129 TRIPLES
23 PREDICATES
30 URIs
20 LITERALS
8 BLANK NODES