会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • METHOD FOR CONTROLLING MACHINES ACCORDING TO PATTERN OF CONTOURS AND LASER CUTTING MACHINE
    • 根据轮廓图和激光切割机控制机器的方法
    • WO2014002660A1
    • 2014-01-03
    • PCT/JP2013/064557
    • 2013-05-20
    • MITSUBISHI ELECTRIC CORPORATION
    • BRAND, Matthew
    • G05B19/31G05B19/4103
    • G05B19/31G05B19/4103G05B2219/34112G05B2219/36199G05B2219/45041G05B2219/49372
    • A set of costs representing operations of a machine along a set of trajectories connecting a set of exit and entry points on contours of a pattern is determined. Each trajectory represents an operation of the machine proceeding from an exit point with an exit velocity to an entry point with an entry velocity according to dynamics of the machine. The set of trajectories includes at least one trajectory representing the operation along a contour with non-zero velocities at corresponding exit and entry points, and at least one trajectory representing the operation between different contours with non-zero velocities at the corresponding exit and entry points. A sequence of the trajectories optimizing a total cost of operation of the machine tracking the pattern is determined based on the costs, and a set of instructions for controlling the machine is determined according to the sequence.
    • 确定一组代表沿着连接模式轮廓上的一组出口点和入口点的一组轨迹的机器的操作。 每个轨迹表示机器从具有出口速度的出口点到具有根据机器的动力学的进入速度的入口点进行的操作。 所述轨迹集包括至少一个轨迹,其表示在对应的出口和入口点处具有非零速度的轮廓的操作,以及表示在相应出口和入口点处具有非零速度的不同轮廓之间的操作的至少一个轨迹 。 基于成本确定优化跟踪图案的机器的总操作成本的轨迹序列,并且根据顺序确定用于控制机器的一组指令。
    • 7. 发明申请
    • SYSTEM AND METHOD FOR GENERATING OPTIMAL LATTICE TOOL PATHS
    • WO2020194976A1
    • 2020-10-01
    • PCT/JP2019/051647
    • 2019-12-25
    • MITSUBISHI ELECTRIC CORPORATION
    • BRAND, Matthew
    • G05B19/4097G05B19/4103
    • A data conversion system includes an interface to receive path data, a memory to store a computer-executable program including a lattice full algorithm and a dynamic programing algorithm, a processor, in connection with the memory, configured to execute the computer-executable program. The processor is configured to perform steps including providing a coordinate system including admissible points, forming, from the path data, a target polyline on the coordinate system, wherein the target polyline represents an approximated surface line of an object, dividing the target polyline into line segments, generating a set of rational vectors by approximating slopes of the line segments based on the lattice full algorithm, arranging the rational vectors to form lower convex hull lines arranged on or above corresponding line segments, wherein the lower convex hull lines are arranged onto the admissible points, wherein the admissible points are on or above the corresponding line segments, selecting a set of endpoints of the lower convex hull lines, and forming a final polyline by merging the endpoints based on the dynamic programing algorithm, wherein the final polyline is arranged to lay on or above the target polyline.