Port of Entry Inspection Algorithms - Center for Discrete 中心离散入境检验算法的端口.pptVIP

Decision Support Algorithms for Port of Entry Inspection  Port of Entry Inspection Algorithms Port of Entry Inspection Algorithms Sequential Decision Making Problem Sequential Decision Making Problem Sequential Decision Making Problem Sequential Decision Making Problem Sequential Decision Making Problem Sequential Decision Making Problem Binary Decision Tree Approach Binary Decision Tree Approach Binary Decision Tree Approach Binary Decision Tree Approach Binary Decision Tree Approach Binary Decision Tree Approach Cost Functions Cost Functions: Delay Costs Cost Functions Cost Functions Cost Functions Complications Complications Research Team For Further Information * Fred S. Roberts DIMACS Center, Rutgers University In collaboration with Los Alamos National Laboratory Preliminary Support: Office of Naval Research Goal: Find ways to intercept illicit nuclear materials and weapons destined for the U.S. via the maritime transportation system Currently inspecting only small % of containers arriving at ports Even inspecting 8% of containers in Port of NY/NJ might bring international trade to a halt (Larrabbee 2002) Aim: Develop decision support algorithms that will help us to “optimally” intercept illicit materials and weapons subject to limits on delays, manpower, and equipment Find inspection schemes that minimize total “cost” including “cost” of false positives and false negatives Mobile Vacis: truck-mounted gamma ray imaging system Stream of containers arrives at a port The Decision Maker’s Problem: Which to inspect? Which inspections next based on previous results? Approach: “decision logics” combinatorial optimization methods Builds on ideas of Stroud and Saeger at LANL Need for new models and methods Containers arriving to be classified into categories. Simple case: 0 = “ok”, 1 = “suspicious” Inspection scheme: specifies which inspections are to be made based on previous observations Containers have attributes, each in a number of sta