公开(公告)号：JP2008134382A

公开(公告)日：2008-06-12

申请号：JP2006319750

申请日：2006-11-28

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： MAHARAJ MUKHERJEE ,  CULP JAMES A ,  LIEBMANN LARS W ,  SCOTT MARSHALL MANSFIELD

IPC: G03F1/30 ,  G03F1/36 ,  G03F1/68 ,  G03F1/70

Abstract: PROBLEM TO BE SOLVED: To provide a method for correcting an optical proximity effect on a mask layout of an integrated circuit. SOLUTION: The method ensures an appropriate functional interaction among circuit features by including functional interlayer and intra-layer constraints on a wafer. The functional constraints used by the present invention are applied to simulated wafer images, which reduces or eliminates EPE (edge placement error) constraints with respect to positions of wafer images while ensuring an appropriate functional interaction. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于校正集成电路的掩模布局上的光学邻近效应的方法。 解决方案：该方法通过在晶片上包括功能性中间层和层内约束来确保电路特征之间的适当功能性交互。 本发明使用的功能约束应用于模拟晶片图像，其减少或消除相对于晶片图像的位置的EPE（边缘放置误差）约束，同时确保适当的功能性交互。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：GB2545134A

公开(公告)日：2017-06-07

申请号：GB201704304

申请日：2012-11-27

Applicant: IBM

Inventor： SHANG Q GUO ,  CANTURK ISCI ,  JONATHAN LENCHNER ,  MAHARAJ MUKHERJEE

IPC: G05D1/02 ,  G05B19/418

Abstract: A method and apparatus for navigating several robots is provided. A environment is discretised into several discrete regions, and a breadth-first search is used to determine a next unvisited region for one of the robots to explore. The robots may each determine the next unvisited region to explore, by taking a hypothetical step (510), in all directions, and maintaining a breadth-first search tree of paths until one declaring robot finds a next unvisited region (520). This declaring robot may then declare to other robots that an unvisited region has been found, and the other robots may then determine if there is a conflict between their planned paths and that of the declaring robot (540). The declaring robots search tree may then be collapsed to a single point corresponding to the found unvisited region (560). The search method may then repeat (570) until there are no regions left to explore (580).

公开(公告)号：GB2545134B

公开(公告)日：2017-10-11

申请号：GB201704304

申请日：2012-11-27

Applicant: IBM

Inventor： SHANG Q GUO ,  CANTURK ISCI ,  JONATHAN LENCHNER ,  MAHARAJ MUKHERJEE

IPC: G05D1/02 ,  G05B19/418

Abstract: Techniques are provided for discovery and monitoring of an environment using a plurality of robots. A plurality of robots navigate an environment by determining a navigation buffer for each of the robots; and allowing each of the robots to navigate within the environment while maintaining a substantially minimum distance from other robots, wherein the substantially minimum distance corresponds to the navigation buffer, and wherein a size of each of the navigation buffers is reduced over time based on a percentage of the environment that remains to be navigated. The robots can also navigate an environment by obtaining a discretization of the environment to a plurality of discrete regions; and determining a next unvisited discrete region for one of the plurality of robots to explore in the exemplary environment using a breadth-first search. The plurality of discrete regions can be, for example, a plurality of real or virtual tiles.

公开(公告)号：GB2511966B

公开(公告)日：2017-05-10

申请号：GB201410495

申请日：2012-11-27

Applicant: IBM

Inventor： SHANG Q GUO ,  CANTURK ISCI ,  MAHARAJ MUKHERJEE ,  JONATHAN LENCHNER

IPC: G05D1/00 ,  G05D1/02

Abstract: Techniques are provided for discovery and monitoring of an environment using a plurality of robots. A plurality of robots navigate an environment by determining a navigation buffer for each of the robots; and allowing each of the robots to navigate within the environment while maintaining a substantially minimum distance from other robots, wherein the substantially minimum distance corresponds to the navigation buffer, and wherein a size of each of the navigation buffers is reduced over time based on a percentage of the environment that remains to be navigated. The robots can also navigate an environment by obtaining a discretization of the environment to a plurality of discrete regions; and determining a next unvisited discrete region for one of the plurality of robots to explore in the exemplary environment using a breadth-first search. The plurality of discrete regions can be, for example, a plurality of real or virtual tiles.