Patents by Inventor Morad Behandish

Morad Behandish has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20210390229
    Abstract: A representation of an initial design domain, at least one subtractive tool assembly, machine degrees of freedom, and a termination criterion are used to iteratively generate intermediate part designs by redistributing the material within the design domain. A measure of inaccessibility of exteriors of the intermediate part designs by the at least one subtractive manufacturing tool assembly are generated. The measure of inaccessibility is used to inform generation of an intermediate part design at a next iteration. The iterative algorithm is terminated when the termination criterion is satisfied, the result of the iterative algorithm being a part design accessible for subtractive manufacturing.
    Type: Application
    Filed: June 15, 2020
    Publication date: December 16, 2021
    Inventors: Amirmassoud Mirzendehdel, Morad Behandish, Saigopal Nelaturi
  • Patent number: 11157672
    Abstract: One embodiment of the present disclosure provides a system for determining a hybrid-manufacturing plan for manufacturing an integrated circuit (IC). During operation, the system can obtain a set of hybrid-manufacturing constraints for manufacturing the IC. The set of hybrid-manufacturing constraints can include a set of primitives, a set of atoms, and an atom end-state vector. An atom can correspond to a unit of spatial volume of the IC. A primitive can represent an additive, subtractive, or a mixed manufacturing process corresponding to one or more atoms of the IC. Next, the system can determine a plurality of feasible hybrid-manufacturing plans based on the set of manufacturing constraints. Each feasible hybrid-manufacturing plan can represent an ordering of the set of primitives that satisfies the atom end-state vector. The system can then determine costs for manufacturing the IC using the plurality feasible hybrid-manufacturing plans.
    Type: Grant
    Filed: September 17, 2020
    Date of Patent: October 26, 2021
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Aleksandar B. Feldman, Morad Behandish, Johan de Kleer, Ion Matei, Saigopal Nelaturi
  • Publication number: 20210192105
    Abstract: The techniques discussed herein generally relate to a method and system for qualitative modeling of and reasoning about the behavior of spatio-temporal physical systems. In some embodiments, qualitative representations based on Tonti diagrams are used to describe lumped or distributed parameter systems. Using a topological structure of the physical system, some embodiments generate qualitative governing equations as symbolic constraints on qualitative state variables. The qualitative constraints may be used to produce a qualitative simulation of the physical system. The qualitative simulation may be used to guide conceptual design iterations with given design criteria, or for instantiation of quantitative or hybrid (qualitative and quantitative) models and simulations.
    Type: Application
    Filed: December 23, 2019
    Publication date: June 24, 2021
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Morad Behandish, III, Johan de Kleer, Randi Wang
  • Publication number: 20210191362
    Abstract: Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
    Type: Application
    Filed: February 12, 2021
    Publication date: June 24, 2021
    Inventors: Saigopal Nelaturi, Morad Behandish
  • Publication number: 20210073349
    Abstract: A method of classifying design criteria includes receiving design criteria for a product part. The criteria comprise one or both of performance and manufacturing criteria. The design criteria are sorted into different classes of one or both of one or more objective functions and one or more constraints based on when they can be satisfied or optimized. Constraint violations are determined. A design workflow is produced to generate one or more designs of a part to comply with one or more of satisfying constraints and optimizing objective functions.
    Type: Application
    Filed: September 5, 2019
    Publication date: March 11, 2021
    Inventors: Amirmassoud Mirzendehdel, Morad Behandish, Saigopal Nelaturi
  • Patent number: 10921781
    Abstract: Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
    Type: Grant
    Filed: July 19, 2019
    Date of Patent: February 16, 2021
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Saigopal Nelaturi, Morad Behandish
  • Publication number: 20200319628
    Abstract: A systematic approach to constructing process plans for hybrid manufacturing is provided. The process plans include arbitrary combinations of AM and SM processes. Unlike the suboptimal conventional practice, the sequence of AM and SM modalities is not fixed beforehand. Rather, all potentially viable process plans to fabricate a desired target part from arbitrary alternating sequences of pre-defined AM and SM modalities are explored in a systematic fashion. Once the state space of all process plans has been enumerated in terms of a partially ordered set of states, advanced artificial intelligence (AI) planning techniques are utilized to rapidly explore the state space, eliminate invalid process plans, for instance, process plans that make no physical sense, and optimize among the valid process plans using a cost function, for instance, manufacturing time and material or process costs.
    Type: Application
    Filed: June 16, 2020
    Publication date: October 8, 2020
    Inventors: Morad Behandish, Saigopal Nelaturi, Johan de Kleer
  • Patent number: 10719069
    Abstract: A systematic approach to constructing process plans for hybrid manufacturing is provided. The process plans include arbitrary combinations of AM and SM processes. Unlike the suboptimal conventional practice, the sequence of AM and SM modalities is not fixed beforehand. Rather, all potentially viable process plans to fabricate a desired target part from arbitrary alternating sequences of pre-defined AM and SM modalities are explored in a systematic fashion. Once the state space of all process plans has been enumerated in terms of a partially ordered set of states, advanced artificial intelligence (AI) planning techniques are utilized to rapidly explore the state space, eliminate invalid process plans, for instance, process plans that make no physical sense, and optimize among the valid process plans using a cost function, for instance, manufacturing time and material or process costs.
    Type: Grant
    Filed: December 29, 2017
    Date of Patent: July 21, 2020
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Morad Behandish, Saigopal Nelaturi, Johan de Kleer
  • Publication number: 20200209832
    Abstract: The present disclosure is directed to a method and system for hierarchical multi-scale design with the aid of a digital computer. A hierarchical representation of a shape and material distribution is constructed which satisfies a top-level constraint at a top-level of representation. Properties for families of designs at each of the lower levels of representation that satisfy additional constraints link each of the lower levels of representation to at least a next higher level of the representation.
    Type: Application
    Filed: December 31, 2018
    Publication date: July 2, 2020
    Inventors: Morad Behandish, Amir Mirzendehdel, Saigopal Nelaturi
  • Publication number: 20200209834
    Abstract: Set differences between an as-designed and an as-manufactured model are computed. Discrepancies between the as-designed model and the as-manufactured model are determined based under-deposition and over-deposition features of the set differences. Based on the discrepancies, an input to a manufacturing instrument is changed to reduce topological differences between the as-manufactured model and the as-designed model.
    Type: Application
    Filed: December 28, 2018
    Publication date: July 2, 2020
    Inventors: Morad Behandish, Saigopal Nelaturi
  • Publication number: 20190351621
    Abstract: Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
    Type: Application
    Filed: July 19, 2019
    Publication date: November 21, 2019
    Inventors: Saigopal Nelaturi, Morad Behandish
  • Patent number: 10359764
    Abstract: Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
    Type: Grant
    Filed: December 29, 2017
    Date of Patent: July 23, 2019
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Saigopal Nelaturi, Morad Behandish
  • Publication number: 20190204807
    Abstract: Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
    Type: Application
    Filed: December 29, 2017
    Publication date: July 4, 2019
    Inventors: Saigopal Nelaturi, Morad Behandish
  • Publication number: 20190204813
    Abstract: A systematic approach to constructing process plans for hybrid manufacturing is provided. The process plans include arbitrary combinations of AM and SM processes. Unlike the suboptimal conventional practice, the sequence of AM and SM modalities is not fixed beforehand. Rather, all potentially viable process plans to fabricate a desired target part from arbitrary alternating sequences of pre-defined AM and SM modalities are explored in a systematic fashion. Once the state space of all process plans has been enumerated in terms of a partially ordered set of states, advanced artificial intelligence (AI) planning techniques are utilized to rapidly explore the state space, eliminate invalid process plans, for instance, process plans that make no physical sense, and optimize among the valid process plans using a cost function, for instance, manufacturing time and material or process costs.
    Type: Application
    Filed: December 29, 2017
    Publication date: July 4, 2019
    Inventors: Morad Behandish, Saigopal Nelaturi, Johan de Kleer
  • Publication number: 20190197448
    Abstract: An approach to architecting engineering design and digital manufacturing software systems by orchestrating several independently deployable, limited in scope, small software components (i.e., microservices). Interactions between these components are composed via first-order descriptions of workflows, allowing the construction of flexible, scalable, resilient systems.
    Type: Application
    Filed: December 21, 2017
    Publication date: June 27, 2019
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Saigopal Nelaturi, Alexandre Perez, Morad Behandish