307:
390:
80: }. It can also be viewed as the problem of describing the solution set of the quantified constraint "
226:
of non-overlapping boxes. The algorithm can be made more efficient by replacing the inclusion tests by
292:
474:
Colle, E.; Galerne, S. (2013). "Mobile robot localization by multiangulation using set inversion".
101:
328:
139:
42:
450:"Guaranteed Estimation of Electrochemical Parameters by Set Inversion Using Interval Analysis"
206:
Otherwise, the box the box is bisected except if its width is smaller than a given precision.
348:
422:
299:. Since + = + = is inside , we conclude that the whole box × is inside
8:
227:
211:
16:
Mathematical problem of finding the set mapped by a specified function to a certain range
449:
426:
522:
223:
434:
579:
526:
386:
367:
154:
132:
35:
556:
541:
514:
502:
483:
430:
363:
158:
503:"A set-membership approach for high integrity height-aided satellite positioning"
407:
320:
487:
168:
made with non-overlapping boxes. For each box , we perform the following tests:
324:
518:
573:
28:
349:"Set inversion via interval analysis for nonlinear bounded-error estimation"
20:
327:, for localization or for the characterization of stability domains of
406:
Jaulin, L.; Godet, J.L; Walter, E.; Elliasmine, A.; Leduff, Y. (1997).
448:
Braems, I.; Berthier, F.; Jaulin, L.; Kieffer, M.; Walter, E. (2001).
560:
219:
196:
542:"Guaranteed characterization of stability domains via set inversion"
295:
the interval , we conclude that the box × is outside
306:
153:
is nonlinear the set inversion problem can be solved using
447:
405:
380:
381:
Jaulin, L.; Kieffer, M.; Didrit, O.; Walter, E. (2001).
408:"Light scattering data analysis via set inversion"
500:
571:
164:The main idea consists in building a paving of
415:Journal of Physics A: Mathematical and General
539:
473:
346:
291:For instance, since + = + = does not
310:A ring defined as a set inversion problem
210:To check the two first tests, we need an
305:
572:
457:Journal of Electroanalytical Chemistry
501:Drevelle, V.; Bonnifait, Ph. (2011).
27:is the problem of characterizing the
218:. Classified boxes are stored into
13:
14:
591:
319:Set inversion is mainly used for
214:(or an inclusion function) for
540:Walter, E.; Jaulin, L. (1994).
476:Robotics and Autonomous Systems
347:Jaulin, L.; Walter, E. (1993).
533:
494:
467:
441:
399:
374:
340:
314:
288:is represented on the figure.
1:
334:
368:10.1016/0005-1098(93)90106-4
7:
488:10.1016/j.robot.2012.09.006
435:10.1088/0305-4470/30/22/012
100:) is a constraint, e.g. an
10:
596:
549:IEEE Trans. Autom. Control
323:, for nonlinear parameter
233:
519:10.1007/s10291-010-0195-3
383:Applied Interval Analysis
329:linear dynamical systems
311:
111:In most applications,
309:
104:, describing the set
385:. Berlin: Springer.
199:we conclude that ∩
180:we conclude that ⊂
427:1997JPhA...30.7733J
115:is a function from
312:
212:interval extension
421:(22): 7733–7738.
155:interval analysis
133:Cartesian product
587:
565:
564:
561:10.1109/9.286277
546:
537:
531:
530:
498:
492:
491:
471:
465:
464:
454:
445:
439:
438:
412:
403:
397:
396:
378:
372:
371:
362:(4): 1053–1064.
353:
344:
287:
286:
275:
274:
159:branch-and-bound
157:combined with a
595:
594:
590:
589:
588:
586:
585:
584:
570:
569:
568:
544:
538:
534:
499:
495:
472:
468:
452:
446:
442:
410:
404:
400:
393:
379:
375:
351:
345:
341:
337:
317:
285:
282:
281:
280:
273:
270:
269:
268:
263:
256:
236:
17:
12:
11:
5:
593:
583:
582:
567:
566:
555:(4): 886–889.
532:
513:(4): 357–368.
493:
466:
440:
398:
391:
373:
338:
336:
333:
325:set estimation
316:
313:
283:
271:
261:
254:
235:
232:
208:
207:
204:
185:
15:
9:
6:
4:
3:
2:
592:
581:
578:
577:
575:
562:
558:
554:
550:
543:
536:
528:
524:
520:
516:
512:
508:
507:GPS Solutions
504:
497:
489:
485:
481:
477:
470:
462:
458:
451:
444:
436:
432:
428:
424:
420:
416:
409:
402:
394:
392:1-85233-219-0
388:
384:
377:
369:
365:
361:
357:
350:
343:
339:
332:
330:
326:
322:
321:path planning
308:
304:
302:
298:
294:
289:
279:
267:
260:
253:
249:
245:
241:
231:
229:
225:
221:
217:
213:
205:
202:
198:
194:
190:
186:
183:
179:
175:
171:
170:
169:
167:
162:
160:
156:
152:
147:
145:
141:
138:
134:
130:
126:
122:
118:
114:
109:
107:
103:
99:
95:
91:
87:
83:
79:
75:
71:
67:
63:
59:
55:
51:
47:
44:
40:
37:
33:
30:
26:
25:set inversion
22:
552:
548:
535:
510:
506:
496:
482:(1): 39–48.
479:
475:
469:
460:
456:
443:
418:
414:
401:
382:
376:
359:
355:
342:
318:
300:
296:
290:
277:
265:
258:
251:
247:
243:
239:
237:
215:
209:
200:
192:
191: () ∩
188:
181:
177:
176: () ⊂
173:
165:
163:
150:
148:
143:
136:
128:
127:is a box of
124:
123:and the set
120:
116:
112:
110:
105:
97:
93:
89:
85:
81:
77:
73:
69:
65:
61:
60: ) = {
57:
53:
49:
45:
38:
31:
24:
18:
315:Application
228:contractors
161:algorithm.
92:))", where
21:mathematics
356:Automatica
335:References
220:subpavings
102:inequality
527:121728552
293:intersect
246:() where
140:intervals
580:Topology
574:Category
250: (
238:The set
222:, i.e.,
131:(i.e. a
96:(
88: (
48:, i.e.,
43:function
29:preimage
423:Bibcode
234:Example
525:
389:
545:(PDF)
523:S2CID
453:(PDF)
411:(PDF)
352:(PDF)
224:union
149:When
41:by a
34:of a
463:(1).
387:ISBN
303:.
264:) =
203:= ∅;
76:) ∈
557:doi
515:doi
484:doi
461:495
431:doi
364:doi
187:if
172:if
146:).
142:of
135:of
119:to
36:set
19:In
576::
553:39
551:.
547:.
521:.
511:15
509:.
505:.
480:66
478:.
459:.
455:.
429:.
419:30
417:.
413:.
360:29
358:.
354:.
331:.
276:+
257:,
242:=
230:.
195:=
108:.
68:|
64:∈
52:=
23:,
563:.
559::
529:.
517::
490:.
486::
437:.
433::
425::
395:.
370:.
366::
301:X
297:X
284:2
278:x
272:1
266:x
262:2
259:x
255:1
252:x
248:f
244:f
240:X
216:f
201:X
197:∅
193:Y
189:f
184:;
182:X
178:Y
174:f
166:R
151:f
144:R
137:p
129:R
125:Y
121:R
117:R
113:f
106:Y
98:y
94:Y
90:x
86:f
84:(
82:Y
78:Y
74:x
72:(
70:f
66:R
62:x
58:Y
56:(
54:f
50:X
46:f
39:Y
32:X
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
