By Topic

Smart obstacles in time dependent electromagnetic scattering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
F. Zirilli ; Dipt. di Matematica G. Castelnuovo, Univ. di Roma La Sapienza, Italy

Smart (or active) obstacles are obstacles that, when illuminated by an incoming field, react by actuating a policy in order to pursue an assigned goal. The design of smart objects can be improved by the availability of satisfactory mathematical models. We propose the use of models based on optimal control problems to describe the behaviour of smart objects. We restrict our attention to the context of time dependent electromagnetic scattering. In this context, the smart obstacle, in order to pursue its goal, circulates on its boundary a surface electric current density. The optimal control problems associated with these obstacles give a way of characterizing and computing the current densities needed as optimal solutions of the mathematical problems considered. The goal pursued by smart obstacles is one of the following: 1) to be undetectable (i.e. furtivity problem); 2) to appear to have a different shape (i.e. masking problem); 3) to appear in a different location from its actual one (i.e. ghost obstacle problem). We concentrate on furtivity and masking problems in time dependent three dimensional electromagnetic obstacle scattering.

Published in:

Antennas and Propagation Society International Symposium, 2004. IEEE  (Volume:4 )

Date of Conference:

20-25 June 2004